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
50781982
Selecting cryptographic key sizes
AK Lenstra, ER Verheul
Journal of cryptology 14 (4), 255-293, 2001
13672001
The development of the number field sieve
AK Lenstra, HW Lenstra
Springer Science & Business Media, 1993
9371993
Factorization of a 768-bit RSA modulus
T Kleinjung, K Aoki, J Franke, AK Lenstra, E Thomé, JW Bos, P Gaudry, ...
Annual Cryptology Conference, 333-350, 2010
5762010
The number field sieve
AK Lenstra, HW Lenstra Jr, MS Manasse, JM Pollard
Proceedings of the twenty-second annual ACM symposium on Theory of computing …, 1990
5451990
The XTR public key system
AK Lenstra, ER Verheul
Annual International Cryptology Conference, 1-19, 2000
3832000
Algorithms in number theory
AK Lenstra, HW Lenstra Jr
Algorithms and complexity, 673-715, 1990
3041990
Chosen-prefix collisions for MD5 and colliding X. 509 certificates for different identities
M Stevens, A Lenstra, B De Weger
Annual International Conference on the Theory and Applications of …, 2007
296*2007
Ron was wrong, Whit is right
A Lenstra, JP Hughes, M Augier, JW Bos, T Kleinjung, C Wachter
IACR, 2012
288*2012
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, ...
Annual International Cryptology Conference, 55-69, 2009
2552009
Factorization of a 512-bit RSA modulus
S Cavallar, B Dodson, AK Lenstra, W Lioen, PL Montgomery, B Murphy, ...
International Conference on the Theory and Applications of Cryptographic …, 2000
2312000
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
2071994
Chinese remaindering based cryptosystems in the presence of faults
M Joye, AK Lenstra, JJ Quisquater
Journal of cryptology 12 (4), 241-245, 1999
2051999
The factorization of the ninth Fermat number
AK Lenstra, HW Lenstra, MS Manasse, JM Pollard
Mathematics of Computation 61 (203), 319-349, 1993
1831993
Factoring multivariate polynomials over finite fields
AK Lenstra
Journal of Computer and System Sciences 30 (2), 235-248, 1985
1831985
Factoring by electronic mail
AK Lenstra, MS Manasse
Workshop on the Theory and Application of of Cryptographic Techniques, 355-371, 1989
1771989
Cyclotomic polynomial construction of discrete logarithm cryptosystems over finite fields
AK Lenstra
US Patent 6,665,405, 2003
161*2003
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
1552008
Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers
R Kannan, AK Lenstra, L Lovász
Mathematics of Computation 50 (181), 235-250, 1988
1511988
Unbelievable security matching AES security using public key systems
AK Lenstra
International Conference on the Theory and Application of Cryptology and …, 2001
1442001
The system can't perform the operation now. Try again later.
Articles 1–20