scientific article; zbMATH DE number 1440074

MaRDI QIDQ4950064zbMATH OpenFDO

Authors Arjen K. Lenstra, Eric R. Verheul

Publication date 22 November 2001

zbMATH Keywords

cryptographic key sizescryptosystemsdiscrete logarithm based cryptosystemsRSAsymmetric cryptosystems

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Selecting cryptographic key sizes
• scientific article; zbMATH DE number 503336
• Elliptic Curve Cryptosystems
• Public-key cryptography. State of the art and future directions. E.I.S.S. workshop, Oberwolfach, Germany, July 3-6, 1991. Final report

Cited in

(17)

• Efficient public key encryption with smallest ciphertext expansion from factoring
• A public key cryptosystem based on a subgroup membership problem
• Universal security. From bits and mips to pools, lakes -- and beyond
• Using the cloud to determine key strengths
• On the strength comparison of the ECDLP and the IFP
• Efficient statically-secure large-universe multi-authority attribute-based encryption
• scientific article; zbMATH DE number 2081059 (Why is no real title available?)
• Impact factors involved in cryptoperiod computation in key compromise impersonation scenario
• History of Cryptographic Key Sizes
• Computational hardness of IFP and ECDLP
• IND-CCA2 secure McEliece-type modification in the standard model
• Keyword Field-Free Conjunctive Keyword Searches on Encrypted Data and Extension for Dynamic Groups
• Selecting cryptographic key sizes
• A security analysis of two classes of RSA-like cryptosystems
• Choosing parameters for one IND-CCA2 secure McEliece modification in the standard model
• The case of small prime numbers versus the Okamoto-Uchiyama cryptosystem
• A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4950064)