scientific article; zbMATH DE number 1440074

MaRDI QIDQ4950064zbMATH OpenFDO

Authors Arjen K. Lenstra, Eric R. Verheul

Publication date 22 November 2001

zbMATH Keywords

RSAcryptosystemssymmetric cryptosystemsdiscrete logarithm based cryptosystemscryptographic key sizes

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

(15)

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

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)