Arjen K. Lenstra
Author's Web Page
39 papers in database with 4386 citations  H-number: 28
Journal Papers
[Sort papers chronologically] [Sort papers by citations count]
1. Arjen K. Lenstra,  Eric R. Verheul,  Selecting Cryptographic Key Sizes, Journal of Cryptology, Volume 14(4), pp. 255 - 293, Springer, 2001. [Cited 586 times ]
2. Arjen K. Lenstra,  Integer Factoring, Designs, Codes and Cryptography, Volume 19(2), pp. 101 - 128, Springer, 2000. [Electronic Edition][Cited 569 times ]
3. Marc Joye,  Arjen K. Lenstra,  Jean-Jacques Quisquater,  Chinese Remaindering Based Cryptosystems in the Presence of Faults, Journal of Cryptology, Volume 12(4), pp. 241 - 245, Springer, 1999. [Cited 101 times ]
4. Arjen K. Lenstra,  Yacov Yacobi,  User Impersonation in Key Certification Schemes, Journal of Cryptology, Volume 6(4), pp. 225 - 232, Springer, 1993. [Cited 4 times ]
5. Arjen K. Lenstra,  Hendrik W. Lenstra,  Låszló Lovåsz,  Factoring Polynomials with Rational Coefficients, Mathematische Annalen, Volume 261(4), pp. 515 - 534, Springer, 1982. [Cited 1505 times ]
Conference Papers
[Sort papers chronologically] [Sort papers by citations count]
1. Marc Stevens,  Alexander Sotirov,  Jacob Appelbaum,  Arjen K. Lenstra,  David Molnar,  Dag Arne Osvik,  Benjamin M. M. de Weger,  Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate, pp. 55 - 69, CRYPTO 2009. [Electronic Edition][Cited 48 times ]
2. Pascal Junod,  Alexandre Karlov,  Arjen K. Lenstra,  Improving the Boneh-Franklin Traitor Tracing Scheme, pp. 88 - 104, PKC 2009. [Electronic Edition][Cited 1 times ]
3. Kazumaro Aoki,  Jens Franke,  Thorsten Kleinjung,  Arjen K. Lenstra,  Dag Arne Osvik,  A Kilobit Special Number Field Sieve Factorization, pp. 1 - 12, ASIACRYPT 2007. [Electronic Edition][Cited 22 times ]
4. Marc Stevens,  Arjen K. Lenstra,  Benjamin M. M. de Weger,  Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities, pp. 1 - 22, EUROCRYPT 2007. [Electronic Edition][Cited 65 times ]
5. Arjen K. Lenstra,  Dan Page,  Martijn Stam,  Discrete Logarithm Variants of VSH, pp. 229 - 242, VIETCRYPT 2006. [Electronic Edition][Cited 2 times ]
6. Scott Contini,  Arjen K. Lenstra,  Ron Steinfeld,  VSH, an Efficient and Provable Collision-Resistant Hash Function, pp. 165 - 182, EUROCRYPT 2006. [Electronic Edition][IACR Online Archive][Cited 67 times ]
7. Arjen K. Lenstra,  Benjamin M. M. de Weger,  Twin RSA, pp. 222 - 228, MYCRYPT 2005. [Electronic Edition][Cited 5 times ]
8. Arjen K. Lenstra,  Eran Tromer,  Adi Shamir,  Wil Kortsmit,  Bruce Dodson,  James Hughes,  Paul C. Leyland,  Factoring Estimates for a 1024-Bit RSA Modulus, pp. 55 - 74, ASIACRYPT 2003. [Electronic Edition][IACR Online Archive][Cited 43 times ]
9. Arjen K. Lenstra,  Adi Shamir,  Jim Tomlinson,  Eran Tromer,  Analysis of Bernstein's Factorization Circuit, pp. 1 - 26, ASIACRYPT 2002. [Electronic Edition][IACR Online Archive][Cited 39 times ]
10. Martijn Stam,  Arjen K. Lenstra,  Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions, pp. 318 - 332, CHES 2002. [Electronic Edition][Cited 31 times ]
11. Arjen K. Lenstra,  Igor Shparlinski,  Selective Forgery of RSA Signatures with Fixed-Pattern Padding, pp. 228 - 236, PKC 2002. [Electronic Edition][Cited 7 times ]
12. Martijn Stam,  Arjen K. Lenstra,  Speeding Up XTR, pp. 125 - 143, ASIACRYPT 2001. [Electronic Edition][IACR Online Archive][Cited 61 times ]
13. Arjen K. Lenstra,  Unbelievable Security. Matching AES Security Using Public Key Systems, pp. 67 - 86, ASIACRYPT 2001. [Electronic Edition][IACR Online Archive][Cited 72 times ]
14. Arjen K. Lenstra,  Eric R. Verheul,  Fast Irreducibility and Subgroup Membership Testing in XTR, pp. 73 - 86, PKC 2001. [Electronic Edition][Cited 29 times ]
15. Arjen K. Lenstra,  Igor Shparlinski,  On the Security of Lenstra's Variant of DSA without Long Inversions, pp. 64 - 72, PKC 2001. [Electronic Edition][No citation]
16. Arjen K. Lenstra,  Eric R. Verheul,  Key Improvements to XTR, pp. 220 - 233, ASIACRYPT 2000. [Electronic Edition][Cited 73 times ]
17. Arjen K. Lenstra,  Eric R. Verheul,  The XTR Public Key System, pp. 1 - 19, CRYPTO 2000. [Electronic Edition][IACR Online Archive][Cited 242 times ]
18. Arjen K. Lenstra,  Adi Shamir,  Analysis and Optimization of the TWINKLE Factoring Device, pp. 35 - 52, EUROCRYPT 2000. [Electronic Edition][IACR Online Archive][Cited 28 times ]
19. Stefania Cavallar,  Bruce Dodson,  Arjen K. Lenstra,  Walter M. Lioen,  Peter L. Montgomery,  Brian Murphy,  Herman te Riele,  Karen Aardal,  Jeff Gilchrist,  GÊrard Guillerm,  Paul C. Leyland,  JoÍl Marchand,  François Morain,  Alec Muffett,  Chris Putnam,  Craig Putnam,  Paul Zimmermann,  Factorization of a 512-Bit RSA Modulus, pp. 1 - 18, EUROCRYPT 2000. [Electronic Edition][IACR Online Archive][Cited 94 times ]
20. Arjen K. Lenstra,  Eric R. Verheul,  Selecting Cryptographic Key Sizes, pp. 446 - 465, PKC 2000. [Electronic Edition][Cited 557 times ]
21. Stefania Cavallar,  Bruce Dodson,  Arjen K. Lenstra,  Paul C. Leyland,  Walter M. Lioen,  Peter L. Montgomery,  Brian Murphy,  Herman te Riele,  Paul Zimmermann,  Factorization of RSA-140 Using the Number Field Sieve, pp. 195 - 207, ASIACRYPT 1999. [Electronic Edition][Cited 31 times ]
22. Arjen K. Lenstra,  Generating RSA Moduli with a Predetermined Portion, pp. 1 - 10, ASIACRYPT 1998. [Electronic Edition][Cited 55 times ]
23. James Cowie,  Bruce Dodson,  R. Marije Elkenbracht-Huizing,  Arjen K. Lenstra,  Peter L. Montgomery,  JÜrg Zayer,  A World Wide Number Field Sieve Factoring Record: On to 512 Bits, pp. 382 - 394, ASIACRYPT 1996. [Electronic Edition][Cited 95 times ]
24. Arjen K. Lenstra,  Generating Standard DSA Signatures Without Long Inversion, pp. 57 - 64, ASIACRYPT 1996. [Electronic Edition][Cited 3 times ]
25. Arjen K. Lenstra,  Peter Winkler,  Yacov Yacobi,  A Key Escrow System with Warrant Bounds, pp. 197 - 207, CRYPTO 1995. [Electronic Edition][Cited 42 times ]
26. Bruce Dodson,  Arjen K. Lenstra,  NFS with Four Large Primes: An Explosive Experiment, pp. 372 - 385, CRYPTO 1995. [Electronic Edition][Cited 42 times ]
27. Daniel Bleichenbacher,  Wieb Bosma,  Arjen K. Lenstra,  Some Remarks on Lucas-Based Cryptosystems, pp. 386 - 396, CRYPTO 1995. [Electronic Edition][Cited 51 times ]
28. Derek Atkins,  Michael Graff,  Arjen K. Lenstra,  Paul C. Leyland,  The Magic Words are Squeamish Ossifrage, pp. 263 - 277, ASIACRYPT 1994. [Electronic Edition][Cited 106 times ]
29. Thomas F. Denny,  Bruce Dodson,  Arjen K. Lenstra,  Mark S. Manasse,  On the Factorization of RSA-120, pp. 166 - 174, CRYPTO 1993. [Electronic Edition][Cited 33 times ]
30. Brandon Dixon,  Arjen K. Lenstra,  Factoring Integers Using SIMD Sieves, pp. 28 - 39, EUROCRYPT 1993. [Electronic Edition][Cited 22 times ]
31. Brandon Dixon,  Arjen K. Lenstra,  Massively Parallel Elliptic Curve Factoring, pp. 183 - 193, EUROCRYPT 1992. [Electronic Edition][Cited 28 times ]
32. Yvo Desmedt,  Peter Landrock,  Arjen K. Lenstra,  Kevin S. McCurley,  Andrew M. Odlyzko,  Rainer A. Rueppel,  Miles E. Smid,  The Eurocrypt '92 Controversial Issue: Trapdoor Primes and Moduli (Panel), pp. 194 - 199, EUROCRYPT 1992. [Electronic Edition][No citation]
33. Arjen K. Lenstra,  Mark S. Manasse,  Factoring With Two Large Primes, pp. 72 - 82, EUROCRYPT 1990. [Electronic Edition][Cited 100 times ]
34. Arjen K. Lenstra,  Mark S. Manasse,  Factoring by Electronic Mail, pp. 355 - 371, EUROCRYPT 1989. [Electronic Edition][Cited 113 times ]

Database status:
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals