Arjen K. Lenstra

Thorsten Kleinjung, Joppe W. Bos, Arjen K. Lenstra, Dag Arne Osvik, Kazumaro Aoki, Scott Contini, Jens Franke, Emmanuel Thomé, Pascal Jermini, Michela Thiémard, Paul C. Leyland, Peter L. Montgomery, Andrey Timofeev, Heinz Stockinger: A heterogeneous computing environment to solve the 768-bit RSA challenge. Cluster Computing 15(1): 53-68 (2012)

Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery: Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction. IJACT 2(3): 212-228 (2012)

Marc Stevens, Arjen K. Lenstra, Benne de Weger: Chosen-prefix collisions for MD5 and applications. IJACT 2(4): 322-359 (2012)

Arjen K. Lenstra, James P. Hughes, Maxime Augier, Joppe W. Bos, Thorsten Kleinjung, Christophe Wachter: Public Keys. CRYPTO 2012: 626-642

Thorsten Kleinjung, Arjen K. Lenstra, Dan Page, Nigel P. Smart: Using the Cloud to Determine Key Strengths. INDOCRYPT 2012: 17-39

Arjen K. Lenstra, James P. Hughes, Maxime Augier, Joppe W. Bos, Thorsten Kleinjung, Christophe Wachter: Ron was wrong, Whit is right. IACR Cryptology ePrint Archive 2012: 64 (2012)

Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery: Efficient SIMD Arithmetic Modulo a Mersenne Number. IEEE Symposium on Computer Arithmetic 2011: 213-221

Arjen K. Lenstra: Birthday Paradox. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 147-148

Arjen K. Lenstra: Integer Factoring. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 611-618

Arjen K. Lenstra: L Notation. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 709-710

Thorsten Kleinjung, Arjen K. Lenstra, Dan Page, Nigel P. Smart: Using the Cloud to Determine Key Strengths. IACR Cryptology ePrint Archive 2011: 254 (2011)

Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra: On the Use of the Negation Map in the Pollard Rho Method. ANTS 2010: 66-82

Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé, Joppe W. Bos, Pierrick Gaudry, Alexander Kruppa, Peter L. Montgomery, Dag Arne Osvik, Herman J. J. te Riele, Andrey Timofeev, Paul Zimmermann: Factorization of a 768-Bit RSA Modulus. CRYPTO 2010: 333-350

Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé, Joppe W. Bos, Pierrick Gaudry, Alexander Kruppa, Peter L. Montgomery, Dag Arne Osvik, Herman J. J. te Riele, Andrey Timofeev, Paul Zimmermann: Factorization of a 768-bit RSA modulus. IACR Cryptology ePrint Archive 2010: 6 (2010)

Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery: Efficient SIMD arithmetic modulo a Mersenne number. IACR Cryptology ePrint Archive 2010: 338 (2010)

Marc Stevens, Alexander Sotirov, Jacob Appelbaum, Arjen K. Lenstra, David Molnar, Dag Arne Osvik, Benne de Weger: Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate. CRYPTO 2009: 55-69

Pascal Junod, Alexandre Karlov, Arjen K. Lenstra: Improving the Boneh-Franklin Traitor Tracing Scheme. Public Key Cryptography 2009: 88-104

Marc Stevens, Alexander Sotirov, Jacob Appelbaum, Arjen K. Lenstra, David Molnar, Dag Arne Osvik, Benne de Weger: Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate. IACR Cryptology ePrint Archive 2009: 111 (2009)

Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery: On the Security of 1024-bit RSA and 160-bit Elliptic Curve Cryptography. IACR Cryptology ePrint Archive 2009: 389 (2009)

S. Hasan Mirjalili, Arjen K. Lenstra: Security Observance throughout the Life-Cycle of Embedded Systems. ESA 2008: 186-192

Pascal Junod, Alexandre Karlov, Arjen K. Lenstra: Improving the Boneh-Franklin Traitor Tracing Scheme. IACR Cryptology ePrint Archive 2008: 384 (2008)

Kazumaro Aoki, Jens Franke, Thorsten Kleinjung, Arjen K. Lenstra, Dag Arne Osvik: A Kilobit Special Number Field Sieve Factorization. ASIACRYPT 2007: 1-12

Marc Stevens, Arjen K. Lenstra, Benne de Weger: Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities. EUROCRYPT 2007: 1-22

Juan A. Garay, Arjen K. Lenstra, Masahiro Mambo, René Peralta (Eds.): Information Security, 10th International Conference, ISC 2007, Valparaíso, Chile, October 9-12, 2007, Proceedings. Lecture Notes in Computer Science 4779, Springer 2007, isbn 978-3-540-75495-4

Kazumaro Aoki, Jens Franke, Thorsten Kleinjung, Arjen K. Lenstra, Dag Arne Osvik: A kilobit special number field sieve factorization. IACR Cryptology ePrint Archive 2007: 205 (2007)

Scott Contini, Arjen K. Lenstra, Ron Steinfeld: VSH, an Efficient and Provable Collision-Resistant Hash Function. EUROCRYPT 2006: 165-182

Arjen K. Lenstra, Dan Page, Martijn Stam: Discrete Logarithm Variants of VSH. VIETCRYPT 2006: 229-242

Marc Stevens, Arjen K. Lenstra, Benne de Weger: Target Collisions for MD5 and Colliding X.509 Certificates for Different Identities. IACR Cryptology ePrint Archive 2006: 360 (2006)

Arjen K. Lenstra, Benne de Weger: On the Possibility of Constructing Meaningful Hash Collisions for Public Keys. ACISP 2005: 267-279

Arjen K. Lenstra, Benjamin M. M. de Weger: Twin RSA. Mycrypt 2005: 222-228

Arjen K. Lenstra: Birthday Paradox. Encyclopedia of Cryptography and Security 2005

Arjen K. Lenstra: Factoring Circuits. Encyclopedia of Cryptography and Security 2005

Arjen K. Lenstra: Integer Factoring. Encyclopedia of Cryptography and Security 2005

Arjen K. Lenstra: L-Notation. Encyclopedia of Cryptography and Security 2005

Arjen K. Lenstra: Smoothness Probability. Encyclopedia of Cryptography and Security 2005

Arjen K. Lenstra: Subgroup Cryptosystems. Encyclopedia of Cryptography and Security 2005

Arjen K. Lenstra, Xiaoyun Wang, Benne de Weger: Colliding X.509 Certificates. IACR Cryptology ePrint Archive 2005: 67 (2005)

Scott Contini, Arjen K. Lenstra, Ron Steinfeld: VSH, an Efficient and Provable Collision Resistant Hash Function. IACR Cryptology ePrint Archive 2005: 193 (2005)

Arjen K. Lenstra, Benjamin M. M. de Weger: Twin RSA. IACR Cryptology ePrint Archive 2005: 195 (2005)

Arjen K. Lenstra: Preface. J. Cryptology 17(4): 233 (2004)

Karen Aardal, Arjen K. Lenstra: Hard Equality Constrained Integer Knapsacks. Math. Oper. Res. 29(3): 724-738 (2004)

Arjen K. Lenstra, Tim Voss: Information Security Risk Assessment, Aggregation, and Mitigation. ACISP 2004: 391-401

Arjen K. Lenstra, Eran Tromer, Adi Shamir, Wil Kortsmit, Bruce Dodson, James P. Hughes, Paul C. Leyland: Factoring Estimates for a 1024-Bit RSA Modulus. ASIACRYPT 2003: 55-74

Paul C. Leyland, Arjen K. Lenstra, Bruce Dodson, Alec Muffett, Samuel S. Wagstaff Jr.: MPQS with Three Large Primes. ANTS 2002: 446-460

Arjen K. Lenstra, Adi Shamir, Jim Tomlinson, Eran Tromer: Analysis of Bernstein's Factorization Circuit. ASIACRYPT 2002: 1-26

Martijn Stam, Arjen K. Lenstra: Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions. CHES 2002: 318-332

Karen Aardal, Arjen K. Lenstra: Hard Equality Constrained Integer Knapsacks. IPCO 2002: 350-366

Arjen K. Lenstra, Igor Shparlinski: Selective Forgery of RSA Signatures with Fixed-Pattern Padding. Public Key Cryptography 2002: 228-236

Arjen K. Lenstra, Eric R. Verheul: Selecting Cryptographic Key Sizes. J. Cryptology 14(4): 255-293 (2001)

Arjen K. Lenstra: Unbelievable Security. Matching AES Security Using Public Key Systems. ASIACRYPT 2001: 67-86

Martijn Stam, Arjen K. Lenstra: Speeding Up XTR. ASIACRYPT 2001: 125-143

Arjen K. Lenstra, Igor Shparlinski: On the Security of Lenstra's Variant of DSA without Long Inversions. Public Key Cryptography 2001: 64-72

Arjen K. Lenstra, Eric R. Verheul: Fast Irreducibility and Subgroup Membership Testing in XTR. Public Key Cryptography 2001: 73-86

Arjen K. Lenstra: Integer Factoring. Des. Codes Cryptography 19(2/3): 101-128 (2000)

Arjen K. Lenstra, Eric R. Verheul: Selecting Cryptographic Key Sizes. Datenschutz und Datensicherheit 24(3) (2000)

Karen Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink: Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances. INFORMS Journal on Computing 12(3): 192-202 (2000)

Karen Aardal, Cor A. J. Hurkens, Arjen K. Lenstra: Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables. Math. Oper. Res. 25(3): 427-442 (2000)

Arjen K. Lenstra, Eric R. Verheul: Key Improvements to XTR. ASIACRYPT 2000: 220-233

Arjen K. Lenstra, Eric R. Verheul: The XTR Public Key System. CRYPTO 2000: 1-19

Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman J. J. 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. EUROCRYPT 2000: 1-18

Arjen K. Lenstra, Adi Shamir: Analysis and Optimization of the TWINKLE Factoring Device. EUROCRYPT 2000: 35-52

Arjen K. Lenstra, Eric R. Verheul: Selecting Cryptographic Key Sizes. Public Key Cryptography 2000: 446-465

Marc Joye, Arjen K. Lenstra, Jean-Jacques Quisquater: Chinese Remaindering Based Cryptosystems in the Presence of Faults. J. Cryptology 12(4): 241-245 (1999)

Arjen K. Lenstra: Efficient Identity Based Parameter Selection for Elliptic Curve Cryptosystems. ACISP 1999: 294-302

Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Paul C. Leyland, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman J. J. te Riele, Paul Zimmermann: Factorization of RSA-140 Using the Number Field Sieve. ASIACRYPT 1999: 195-207

Karen Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink: Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances. IPCO 1999: 1-16

Arjen K. Lenstra: Generating RSA Moduli with a Predetermined Portion. ASIACRYPT 1998: 1-10

Karen Aardal, Cor A. J. Hurkens, Arjen K. Lenstra: Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables. IPCO 1998: 229-242

Arjen K. Lenstra: Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems Over Finite Fields. ACISP 1997: 127-138

Arjen K. Lenstra: Securing the Net - The Fruits of Incompetence. First Monday 1(4) (1996)

Arjen K. Lenstra: Generating Standard DSA Signatures Without Long Inversion. ASIACRYPT 1996: 57-64

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. ASIACRYPT 1996: 382-394

Arjen K. Lenstra, Peter Winkler, Yacov Yacobi: A Key Escrow System with Warrant Bounds. CRYPTO 1995: 197-207

Bruce Dodson, Arjen K. Lenstra: NFS with Four Large Primes: An Explosive Experiment. CRYPTO 1995: 372-385

Daniel Bleichenbacher, Wieb Bosma, Arjen K. Lenstra: Some Remarks on Lucas-Based Cryptosystems. CRYPTO 1995: 386-396

Roger A. Golliver, Arjen K. Lenstra, Kevin S. McCurley: Lattice sieving and trial division. ANTS 1994: 18-27

Derek Atkins, Michael Graff, Arjen K. Lenstra, Paul C. Leyland: The Magic Words are Squeamish Ossifrage. ASIACRYPT 1994: 263-277

Arjen K. Lenstra: Factoring. WDAG 1994: 28-38

Arjen K. Lenstra, Yacov Yacobi: User Impersonation in Key Certification Schemes. J. Cryptology 6(4): 225-232 (1993)

Thomas F. Denny, Bruce Dodson, Arjen K. Lenstra, Mark S. Manasse: On the Factorization of RSA-120. CRYPTO 1993: 166-174

Brandon Dixon, Arjen K. Lenstra: Factoring Integers Using SIMD Sieves. EUROCRYPT 1993: 28-39

Brandon Dixon, Arjen K. Lenstra: Massively Parallel Elliptic Curve Factorin. EUROCRYPT 1992: 183-193

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). EUROCRYPT 1992: 194-199

Arjen K. Lenstra: Massively Parallel Computing and Factoring. LATIN 1992: 344-355

Arjen K. Lenstra, Mark S. Manasse: Factoring With Two Large Primes. EUROCRYPT 1990: 72-82

Arjen K. Lenstra, Hendrik W. Lenstra Jr., Mark S. Manasse, John M. Pollard: The Number Field Sieve. STOC 1990: 564-572

Arjen K. Lenstra, Hendrik W. Lenstra Jr.: Algorithms in Number Theory. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 673-716

Arjen K. Lenstra, Mark S. Manasse: Factoring by Electronic Mail. EUROCRYPT 1989: 355-371

Arjen K. Lenstra: Factoring Multivariate Polynomials over Algebraic Number Fields. SIAM J. Comput. 16(3): 591-598 (1987)

Arjen K. Lenstra: Factoring Multivariate Polynomials over Finite Fields. J. Comput. Syst. Sci. 30(2): 235-248 (1985)

Marc-Paul van der Hulst, Arjen K. Lenstra: Factorization of Polynominals by Transcendental Evaluation. European Conference on Computer Algebra (2) 1985: 138-145

Arjen K. Lenstra: Polynomial - time algorithms for the factorization of polynomials. Bulletin of the EATCS 23: 59-75 (1984)

Arjen K. Lenstra: Factoring Multivariate Integral Polynomials. Theor. Comput. Sci. 34: 207-213 (1984)

Arjen K. Lenstra: Polynomial Factorization by Root Approximation. EUROSAM 1984: 272-276

Arjen K. Lenstra: Factoring Multivariate Polynomials over Algebraic Number Fields. MFCS 1984: 389-396

Ravindran Kannan, Arjen K. Lenstra, László Lovász: Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers. STOC 1984: 191-200

Arjen K. Lenstra: Factoring polynominals over algebraic number fields. EUROCAL 1983: 245-254

Arjen K. Lenstra: Factoring Multivariate Integral Polynomials. ICALP 1983: 458-465

Arjen K. Lenstra: Factoring Multivariate Polynomials over Finite Fields (Extended Abstract). STOC 1983: 189-192

Arjen K. Lenstra: Lattices and Factorization of Polynomials over Algebraic Number Fields. EUROCAM 1982: 32-39