Follow
Arjen Lenstra
Arjen Lenstra
Professor of Computer Science, EPFL
Verified email at epfl.ch
Title
Cited by
Cited by
Year
Factoring polynomials with rational coefficients
AK Lenstra, HW Lenstra, L Lovász
Mathematische annalen 261 (ARTICLE), 515-534, 1982
57081982
The development of the number field sieve
AK Lenstra, W Hendrik Jr
Springer Science & Business Media, 1993
1524*1993
Selecting cryptographic key sizes
ER Verheul, AK Lenstra
Journal of cryptology 14 (ARTICLE), 255-293, 2001
1471*2001
Factorization of a 768-Bit RSA Modulus.
T Kleinjung, K Aoki, J Franke, AK Lenstra, E Thomé, JW Bos, P Gaudry, ...
Crypto 6223, 333-350, 2010
6502010
The XTR public key system
AK Lenstra, ER Verheul
Advances in Cryptology-CRYPTO 2000. 20th Annual International Cryptology …, 2000
4162000
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
337*2007
Ron was wrong, Whit is right
AK Lenstra, JP Hughes, M Augier, JW Bos, T Kleinjung, C Wachter
Cryptology EPrint Archive, 2012
336*2012
Algorithms in number theory
AK Lenstra, HW Lenstra Jr
Algorithms and complexity, 673-715, 1990
3071990
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
2872009
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
2522000
The magic words are squeamish ossifrage
D Atkins, M Graff, AK Lenstra, PC Leyland
Advances in Cryptology—ASIACRYPT'94: 4th International Conferences on the …, 1995
2221995
Chinese remaindering based cryptosystems in the presence of faults
M Joye, AK Lenstra, JJ Quisquater
Journal of cryptology 12, 241-245, 1999
2201999
Factoring multivariate polynomials over finite fields
AK Lenstra
Proceedings of the fifteenth annual ACM symposium on Theory of computing …, 1983
2031983
The factorization of the ninth Fermat number
AK Lenstra, HW Lenstra, MS Manasse, JM Pollard
Mathematics of Computation 61 (203), 319-349, 1993
1951993
Factoring by electronic mail
AK Lenstra, MS Manasse
Advances in Cryptology—EUROCRYPT’89: Workshop on the Theory and Application …, 1990
1841990
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
1812008
Cyclotomic polynomial construction of discrete logarithm cryptosystems over finite fields
AK Lenstra
US Patent 6,665,405, 2003
165*2003
Unbelievable Security Matching AES Security Using Public Key Systems
AK Lenstra
Advances in Cryptology—ASIACRYPT 2001: 7th International Conference on the …, 2001
1602001
Integer factoring
AK Lenstra
Towards a Quarter-Century of Public Key Cryptography: A Special Issue of …, 2000
1602000
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
1571984
The system can't perform the operation now. Try again later.
Articles 1–20