Unbelievable security matching AES security using public key systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2248, Issue , 2001, Pages 67-86

  Lenstra, Arjen K ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PRIVACY;

ADVANCED ENCRYPTION STANDARD; ELGAMAL; ELLIPTIC CURVE; FINITE FIELDS; MULTIPLICATIVE GROUPS; PUBLIC KEY SYSTEMS; PUBLIC KEYS;

CRYPTOGRAPHY;

EID: 84946820591     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45682-1_5     Document Type: Conference Paper

References (22)

1. I. Blake, G. Seroussi, N. Smart, Elliptic curves in cryptography, Cambridge University Press, 1999.
2. H. Cohen, A. Miyaji, T. Ono, Efficient elliptic curve exponentiation using mixed coordinates, Proceedings Asiacrypt’98, LNCS 1514, Springer-Verlag 1998, 51-65.
3. D. Coppersmith, Fast evaluation of logarithms in fields of characteristic two, IEEE Trans. Inform. Theory 30 (1984) 587-594.
4. R. Harley, Rump session presentations at Eurocrypt 2001 and Crypto 2001; data available from argote.ch/Research.html.
5. P.C. Kocher, Breaking DES, RSA Laboratories’ Cryptobytes, v. 4, no 2 (1999), 1-5; also at www.rsasecurity.com/rsalabs/pubs/cryptobytes.
6. A.K. Lenstra, Generating RSAmo duli with a predetermined portion, Proceedings Asiacrypt’98, LNCS 1514, Springer-Verlag 1998, 1-10.
7. A.K. Lenstra, E.R. Verheul, Selecting cryptographic key sizes, to appear in the Journal of Cryptology; available from www.cryptosavvy.com.
8. A.K. Lenstra, E.R. Verheul, The XTR public key system, Proceedings of Crypto 2000, LNCS 1880, Springer-Verlag 2000, 1-19; available from www.ecstr.com.
9. 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 www.ecstr.com.
10. A.J. Menezes, P.C. van Oorschot, S.A. Vanstone, Handbook of applied cryptography, CRC Press, 1997.
11. National institute of standards and technology, Digital signature standard, FIPS Publication 186-2, February 2000.
12. National institute of standards and technology, //csrc.nist.gov/encryption/aes/.
13. National institute of standards and technology, //csrc.nist.gov/cryptval/shs.html.
14. R.L. Rivest, A. Shamir, L.M. Adleman, Cryptographic communications system and method, U.S. Patent 4,405,829, 1983.
15. B. Schneier, Applied cryptography, second edition, Wiley, New York, 1996.
16. R.D. Silverman, Ac ost-based security analysis of symmetric and asymmetric key lengths, RSA Laboratories Bulletin 13, April 2000.
17. 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.
18. M. Stam, A.K. Lenstra, Speeding up XTR, Proceedings Asiacrypt 2001, Springer- Verlag 2001, this volume; available from www.ecstr.com.
19. E. Thome, Computation of discrete logarithms in F2607 , Proceedings Asiacrypt 2001, Springer-Verlag 2001, this volume.
20. 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.
21. M.J. Wiener, personal communication, August 2001.
22. P. Zimmermann, personal communication, 1999.