Abstract
The Advanced Encryption Standard (AES) provides three levels of security: 128, 192, and 256 bits. Given a desired level of security for the AES, this paper discusses matching public key sizes for RSA and the ElGamal family of protocols. For the latter both traditional multiplicative groups of finite fields and elliptic curve groups are considered. The practicality of the resulting systems is commented upon. Despite the conclusions, this paper should not be interpreted as an endorsement of any particular public key system in favor of any other.
Chapter PDF
Similar content being viewed by others
Keywords
- Security Level
- Advance Encryption Standard
- Discrete Logarithm
- High Security Level
- Elliptic Curve Discrete Logarithm Problem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
I. Blake, G. Seroussi, N. Smart, Elliptic curves in cryptography, Cambridge University Press, 1999.
H. Cohen, A. Miyaji, T. Ono, Efficient elliptic curve exponentiation using mixed coordinates, Proceedings Asiacrypt’98, LNCS 1514, Springer-Verlag 1998, 51–65.
D. Coppersmith, Fast evaluation of logarithms in fields of characteristic two, IEEE Trans. Inform. Theory 30 (1984) 587–594.
R. Harley, Rump session presentations at Eurocrypt 2001 and Crypto 2001; data available from argote.ch/Research.html.
P.C. Kocher, Breaking DES, RSA Laboratories’ Cryptobytes, v. 4, no 2 (1999), 1–5; also at http://www.rsasecurity.com/rsalabs/pubs/cryptobytes.
A.K. Lenstra, Generating RSAmo duli with a predetermined portion, Proceedings Asiacrypt’98, LNCS 1514, Springer-Verlag 1998, 1–10.
A.K. Lenstra, E.R. Verheul, Selecting cryptographic key sizes, to appear in the Journal of Cryptology; available from http://www.cryptosavvy.com.
A.K. Lenstra, E.R. Verheul, The XTR public key system, Proceedings of Crypto 2000, LNCS 1880, Springer-Verlag 2000, 1–19; available from http://www.ecstr.com.
A.K. Lenstra, E.R. Verheul, Fast irreducibility and subgroup membership testing in XTR, Proceedings PKC 2001, LNCS 1992, Springer-Verlag 2001, 73–86; available from http://www.ecstr.com.
A.J. Menezes, P.C. van Oorschot, S.A. Vanstone, Handbook of applied cryptography, CRC Press, 1997.
National institute of standards and technology, Digital signature standard, FIPS Publication 186-2, February 2000.
National institute of standards and technology, http://csrc.nist.gov/encryption/aes/.
National institute of standards and technology, http://csrc.nist.gov/cryptval/shs.html.
R.L. Rivest, A. Shamir, L.M. Adleman, Cryptographic communications system and method, U.S. Patent 4,405,829, 1983.
B. Schneier, Applied cryptography, second edition, Wiley, New York, 1996.
R.D. Silverman, A cost-based security analysis of symmetric and asymmetric key lengths, RSA Laboratories Bulletin 13, April 2000.
P. Smith, C. Skinner, Apublic-key cryptosystem and a digital signature system based on the Lucas function analogue to discrete logarithms, Proceedings of Asiacrypt’ 94, LNCS 917, Springer-Verlag 1995, 357–364.
M. Stam, A.K. Lenstra, Speeding up XTR, Proceedings Asiacrypt 2001, Springer-Verlag 2001, this volume; available from http://www.ecstr.com.
E. Thome, Computation of discrete logarithms in F 2607, Proceedings Asiacrypt 2001, Springer-Verlag 2001, this volume.
P.C. van Oorschot, M.J. Wiener, Aknown-plaintext attack on two-key triple encryption, Proceedings Eurocrypt’90, LNCS 473, Springer-Verlag 1991, 318–325.
M.J. Wiener, personal communication, August 2001.
P. Zimmermann, personal communication, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lenstra, A.K. (2001). Unbelievable Security Matching AES Security Using Public Key Systems . In: Boyd, C. (eds) Advances in Cryptology — ASIACRYPT 2001. ASIACRYPT 2001. Lecture Notes in Computer Science, vol 2248. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45682-1_5
Download citation
DOI: https://doi.org/10.1007/3-540-45682-1_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42987-6
Online ISBN: 978-3-540-45682-7
eBook Packages: Springer Book Archive