Arjen Lenstra
Arjen Lenstra
Professor of Computer Science, EPFL
Verified email at
Cited by
Cited by
Factoring polynomials with rational coefficients
AK Lenstra, HW Lenstra, L Lovász
Mathematische annalen 261, 515-534, 1982
The development of the number field sieve
AK Lenstra, HW Lenstra
Springer Science & Business Media, 1993
Selecting cryptographic key sizes
AK Lenstra, ER Verheul
Journal of cryptology 14, 255-293, 2001
Factorization of a 768-bit RSA modulus
T Kleinjung, K Aoki, J Franke, AK Lenstra, E Thomé, JW Bos, P Gaudry, ...
Advances in Cryptology–CRYPTO 2010: 30th Annual Cryptology Conference, Santa …, 2010
The XTR public key system
AK Lenstra, ER Verheul
Advances in Cryptology—CRYPTO 2000: 20th Annual International Cryptology …, 2000
Ron was wrong, Whit is right
AK Lenstra, JP Hughes, M Augier, JW Bos, T Kleinjung, C Wachter
Cryptology EPrint Archive, 2012
Chosen-prefix collisions for MD5 and colliding X. 509 certificates for different identities
M Stevens, A Lenstra, B De Weger
Advances in Cryptology-EUROCRYPT 2007: 26th Annual International Conference …, 2007
Algorithms in number theory
AK Lenstra, HW Lenstra Jr
Algorithms and complexity, 673-715, 1990
Short chosen-prefix collisions for MD5 and the creation of a rogue CA certificate
M Stevens, A Sotirov, J Appelbaum, A Lenstra, D Molnar, DA Osvik, ...
Advances in Cryptology-CRYPTO 2009: 29th Annual International Cryptology …, 2009
Factorization of a 512-bit RSA modulus
S Cavallar, B Dodson, AK Lenstra, W Lioen, PL Montgomery, B Murphy, ...
Advances in Cryptology—EUROCRYPT 2000: International Conference on the …, 2000
The magic words are squeamish ossifrage
D Atkins, M Graff, AK Lenstra, PC Leyland
International Conference on the Theory and Application of Cryptology, 261-277, 1994
Chinese remaindering based cryptosystems in the presence of faults
M Joye, AK Lenstra, JJ Quisquater
Journal of cryptology 12, 241-245, 1999
The factorization of the ninth Fermat number
AK Lenstra, HW Lenstra, MS Manasse, JM Pollard
Mathematics of Computation 61 (203), 319-349, 1993
Factoring multivariate polynomials over finite fields
AK Lenstra
Proceedings of the fifteenth annual ACM symposium on Theory of computing …, 1983
MD5 considered harmful today, creating a rogue CA certificate
A Sotirov, M Stevens, J Appelbaum, AK Lenstra, D Molnar, DA Osvik, ...
25th Annual Chaos Communication Congress, 2008
Factoring by electronic mail
AK Lenstra, MS Manasse
Advances in Cryptology—EUROCRYPT’89: Workshop on the Theory and Application …, 1990
Integer factoring
AK Lenstra
Towards a Quarter-Century of Public Key Cryptography: A Special Issue of …, 2000
Unbelievable Security Matching AES Security Using Public Key Systems
AK Lenstra
International Conference on the Theory and Application of Cryptology and …, 2001
Cyclotomic polynomial construction of discrete logarithm cryptosystems over finite fields
AK Lenstra
US Patent 6,665,405, 2003
Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers
R Kannan, AK Lenstra, L Lovász
Proceedings of the sixteenth annual ACM symposium on Theory of computing …, 1984
The system can't perform the operation now. Try again later.
Articles 1–20