Arjen K. Lenstra

Publication Activity (10 Years)

Years Active: 1981-2024
Publications (10 Years): 11

Top Venues

IACR Cryptol. ePrint Arch.

IEEE Trans. Inf. Theory

Int. J. Appl. Cryptogr.

ISIT

Publications

Jeroen van de Graaf, Arjen K. Lenstra
Delphi: sharing assessments of cryptographic assumptions. IACR Cryptol. ePrint Arch. 2024 (2024)
Robert Granger, Thorsten Kleinjung, Arjen K. Lenstra, Benjamin Wesolowski, Jens Zumbrägel
Computation of a 30750-bit binary field discrete logarithm. Math. Comput. 90 (332) (2021)
Robert Granger, Thorsten Kleinjung, Arjen K. Lenstra, Benjamin Wesolowski, Jens Zumbrägel
Computation of a 30750-Bit Binary Field Discrete Logarithm. IACR Cryptol. ePrint Arch. 2020 (2020)
Hugues Mercier, Maxime Augier, Arjen K. Lenstra
STeP-Archival: Storage Integrity and Tamper Resistance Using Data Entanglement. IEEE Trans. Inf. Theory 64 (6) (2018)
Marguerite Delcourt, Thorsten Kleinjung, Arjen K. Lenstra, Shubhojyoti Nath, Dan Page, Nigel P. Smart
Using the Cloud to Determine Key Strengths - Triennial Update. IACR Cryptol. ePrint Arch. 2018 (2018)
Arjen K. Lenstra, Benjamin Wesolowski
Trustworthy public randomness with sloth, unicorn, and trx. Int. J. Appl. Cryptogr. 3 (4) (2017)
Thorsten Kleinjung, Claus Diem, Arjen K. Lenstra, Christine Priplata, Colin Stahlke
Computation of a 768-Bit Prime Field Discrete Logarithm. EUROCRYPT (1) (2017)
Arjen K. Lenstra
General purpose integer factoring. IACR Cryptol. ePrint Arch. 2017 (2017)
Thorsten Kleinjung, Claus Diem, Arjen K. Lenstra, Christine Priplata, Colin Stahlke
Computation of a 768-bit prime field discrete logarithm. IACR Cryptol. ePrint Arch. 2017 (2017)
Alexandre Gélin, Thorsten Kleinjung, Arjen K. Lenstra
Parametrizations for Families of ECM-Friendly Curves. ISSAC (2017)
Alexandre Gélin, Thorsten Kleinjung, Arjen K. Lenstra
Parametrizations for Families of ECM-friendly curves. IACR Cryptol. ePrint Arch. 2016 (2016)
Andrea Miele, Arjen K. Lenstra
Efficient Ephemeral Elliptic Curve Cryptographic Keys. ISC (2015)
Arjen K. Lenstra, Benjamin Wesolowski
A random zoo: sloth, unicorn, and trx. IACR Cryptol. ePrint Arch. 2015 (2015)
Hugues Mercier, Maxime Augier, Arjen K. Lenstra
STEP-archival: Storage integrity and anti-tampering using data entanglement. ISIT (2015)
Andrea Miele, Arjen K. Lenstra
Efficient ephemeral elliptic curve cryptographic keys. IACR Cryptol. ePrint Arch. 2015 (2015)
Thorsten Kleinjung, Joppe W. Bos, Arjen K. Lenstra
Mersenne Factorization Factory. ASIACRYPT (1) (2014)
Thorsten Kleinjung, Joppe W. Bos, Arjen K. Lenstra
Mersenne factorization factory. IACR Cryptol. ePrint Arch. 2014 (2014)
Andrea Miele, Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra
Cofactorization on Graphics Processing Units. CHES (2014)
Andrea Miele, Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra
Cofactorization on Graphics Processing Units. IACR Cryptol. ePrint Arch. 2014 (2014)
Arjen K. Lenstra, Thorsten Kleinjung, Emmanuel Thomé
Universal security; from bits and mips to pools, lakes - and beyond. IACR Cryptol. ePrint Arch. 2013 (2013)
Arjen K. Lenstra, Thorsten Kleinjung, Emmanuel Thomé
Universal Security - From Bits and Mips to Pools, Lakes - and Beyond. Number Theory and Cryptography (2013)
Marc Stevens, Arjen K. Lenstra, Benne de Weger
Chosen-prefix collisions for MD5 and applications. Int. J. Appl. Cryptogr. 2 (4) (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. Int. J. Appl. Cryptogr. 2 (3) (2012)
Arjen K. Lenstra, James P. Hughes, Maxime Augier, Joppe W. Bos, Thorsten Kleinjung, Christophe Wachter
Public Keys. CRYPTO (2012)
Thorsten Kleinjung, Arjen K. Lenstra, Dan Page, Nigel P. Smart
Using the Cloud to Determine Key Strengths. INDOCRYPT (2012)
Arjen K. Lenstra, James P. Hughes, Maxime Augier, Joppe W. Bos, Thorsten Kleinjung, Christophe Wachter
Ron was wrong, Whit is right. IACR Cryptol. ePrint Arch. 2012 (2012)
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. Clust. Comput. 15 (1) (2012)
Thorsten Kleinjung, Arjen K. Lenstra, Dan Page, Nigel P. Smart
Using the Cloud to Determine Key Strengths. IACR Cryptol. ePrint Arch. 2011 (2011)
Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery
Efficient SIMD Arithmetic Modulo a Mersenne Number. IEEE Symposium on Computer Arithmetic (2011)
Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery
Efficient SIMD arithmetic modulo a Mersenne number. IACR Cryptol. ePrint Arch. 2010 (2010)
S. Hasan Mirjalili, Arjen K. Lenstra
Towards a Structural Secure Design Process. SECURWARE (2010)
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 Cryptol. ePrint Arch. 2010 (2010)
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)
Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra
On the Use of the Negation Map in the Pollard Rho Method. ANTS (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. IACR Cryptol. ePrint Arch. 2009 (2009)
Pascal Junod, Alexandre Karlov, Arjen K. Lenstra
Improving the Boneh-Franklin Traitor Tracing Scheme. Public Key Cryptography (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 Cryptol. ePrint Arch. 2009 (2009)
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)
S. Hasan Mirjalili, Arjen K. Lenstra
Security Observance throughout the Life-Cycle of Embedded Systems. ESA (2008)
Pascal Junod, Alexandre Karlov, Arjen K. Lenstra
Improving the Boneh-Franklin Traitor Tracing Scheme. IACR Cryptol. ePrint Arch. 2008 (2008)
Kazumaro Aoki, Jens Franke, Thorsten Kleinjung, Arjen K. Lenstra, Dag Arne Osvik
A Kilobit Special Number Field Sieve Factorization. ASIACRYPT (2007)
Marc Stevens, Arjen K. Lenstra, Benne de Weger
Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities. EUROCRYPT (2007)
Kazumaro Aoki, Jens Franke, Thorsten Kleinjung, Arjen K. Lenstra, Dag Arne Osvik
A kilobit special number field sieve factorization. IACR Cryptol. ePrint Arch. 2007 (2007)
Scott Contini, Arjen K. Lenstra, Ron Steinfeld
VSH, an Efficient and Provable Collision-Resistant Hash Function. EUROCRYPT (2006)
Arjen K. Lenstra, Dan Page, Martijn Stam
Discrete Logarithm Variants of VSH. VIETCRYPT (2006)
Marc Stevens, Arjen K. Lenstra, Benne de Weger
Target Collisions for MD5 and Colliding X.509 Certificates for Different Identities. IACR Cryptol. ePrint Arch. 2006 (2006)
Arjen K. Lenstra, Benne de Weger
On the Possibility of Constructing Meaningful Hash Collisions for Public Keys. ACISP (2005)
Arjen K. Lenstra, Benjamin M. M. de Weger
Twin RSA. Mycrypt (2005)
Arjen K. Lenstra, Xiaoyun Wang, Benne de Weger
Colliding X.509 Certificates. IACR Cryptol. ePrint Arch. 2005 (2005)
Arjen K. Lenstra, Benjamin M. M. de Weger
Twin RSA. IACR Cryptol. ePrint Arch. 2005 (2005)
Scott Contini, Arjen K. Lenstra, Ron Steinfeld
VSH, an Efficient and Provable Collision Resistant Hash Function. IACR Cryptol. ePrint Arch. 2005 (2005)
Arjen K. Lenstra, Tim Voss
Information Security Risk Assessment, Aggregation, and Mitigation. ACISP (2004)
Karen Aardal, Arjen K. Lenstra
Hard Equality Constrained Integer Knapsacks. Math. Oper. Res. 29 (3) (2004)
Arjen K. Lenstra
Preface. J. Cryptol. 17 (4) (2004)
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)
Karen Aardal, Arjen K. Lenstra
Hard Equality Constrained Integer Knapsacks. IPCO (2002)
Martijn Stam, Arjen K. Lenstra
Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions. CHES (2002)
Arjen K. Lenstra, Igor E. Shparlinski
Selective Forgery of RSA Signatures with Fixed-Pattern Padding. Public Key Cryptography (2002)
Paul C. Leyland, Arjen K. Lenstra, Bruce Dodson, Alec Muffett, Samuel S. Wagstaff Jr.
MPQS with Three Large Primes. ANTS (2002)
Arjen K. Lenstra, Adi Shamir, Jim Tomlinson, Eran Tromer
Analysis of Bernstein's Factorization Circuit. ASIACRYPT (2002)
Arjen K. Lenstra
Unbelievable Security. Matching AES Security Using Public Key Systems. ASIACRYPT (2001)
Arjen K. Lenstra, Eric R. Verheul
Fast Irreducibility and Subgroup Membership Testing in XTR. Public Key Cryptography (2001)
Arjen K. Lenstra, Igor E. Shparlinski
On the Security of Lenstra's Variant of DSA without Long Inversions. Public Key Cryptography (2001)
Arjen K. Lenstra, Eric R. Verheul
Selecting Cryptographic Key Sizes. J. Cryptol. 14 (4) (2001)
Martijn Stam, Arjen K. Lenstra
Speeding Up XTR. ASIACRYPT (2001)
Arjen K. Lenstra, Eric R. Verheul
Key Improvements to XTR. ASIACRYPT (2000)
Arjen K. Lenstra, Adi Shamir
Analysis and Optimization of the TWINKLE Factoring Device. EUROCRYPT (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 J. Comput. 12 (3) (2000)
Arjen K. Lenstra, Eric R. Verheul
Selecting Cryptographic Key Sizes. Public Key Cryptography (2000)
Arjen K. Lenstra, Eric R. Verheul
Selecting Cryptographic Key Sizes. Datenschutz und Datensicherheit 24 (3) (2000)
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)
Arjen K. Lenstra, Eric R. Verheul
The XTR Public Key System. CRYPTO (2000)
Arjen K. Lenstra
Integer Factoring. Des. Codes Cryptogr. 19 (2/3) (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) (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 Cornuéjols-Dawande Instances. IPCO (1999)
Arjen K. Lenstra
Efficient Identity Based Parameter Selection for Elliptic Curve Cryptosystems. ACISP (1999)
Marc Joye, Arjen K. Lenstra, Jean-Jacques Quisquater
Chinese Remaindering Based Cryptosystems in the Presence of Faults. J. Cryptol. 12 (4) (1999)
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)
Karen Aardal, Cor A. J. Hurkens, Arjen K. Lenstra
Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables. IPCO (1998)
Arjen K. Lenstra
Generating RSA Moduli with a Predetermined Portion. ASIACRYPT (1998)
Arjen K. Lenstra
Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems Over Finite Fields. ACISP (1997)
Arjen K. Lenstra
Generating Standard DSA Signatures Without Long Inversion. ASIACRYPT (1996)
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)
Arjen K. Lenstra
Securing the Net - The Fruits of Incompetence. First Monday 1 (4) (1996)
Daniel Bleichenbacher, Wieb Bosma, Arjen K. Lenstra
Some Remarks on Lucas-Based Cryptosystems. CRYPTO (1995)
Arjen K. Lenstra, Peter Winkler, Yacov Yacobi
A Key Escrow System with Warrant Bounds. CRYPTO (1995)
Bruce Dodson, Arjen K. Lenstra
NFS with Four Large Primes: An Explosive Experiment. CRYPTO (1995)
Derek Atkins, Michael Graff, Arjen K. Lenstra, Paul C. Leyland
The Magic Words are Squeamish Ossifrage. ASIACRYPT (1994)
Arjen K. Lenstra
Factoring. WDAG (1994)
Roger A. Golliver, Arjen K. Lenstra, Kevin S. McCurley
Lattice sieving and trial division. ANTS (1994)
Arjen K. Lenstra
Uses of Randomness in Algorithms and Protocols (Joe Kilian). SIAM Rev. 35 (2) (1993)
Thomas F. Denny, Bruce Dodson, Arjen K. Lenstra, Mark S. Manasse
On the Factorization of RSA-120. CRYPTO (1993)
Arjen K. Lenstra, Yacov Yacobi
User Impersonation in Key Certification Schemes. J. Cryptol. 6 (4) (1993)
Brandon Dixon, Arjen K. Lenstra
Factoring Integers Using SIMD Sieves. EUROCRYPT (1993)
Brandon Dixon, Arjen K. Lenstra
Massively Parallel Elliptic Curve Factorin. EUROCRYPT (1992)
Arjen K. Lenstra
Massively Parallel Computing and Factoring. LATIN (1992)
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)
Arjen K. Lenstra, Mark S. Manasse
Factoring With Two Large Primes. EUROCRYPT (1990)
Arjen K. Lenstra, Hendrik W. Lenstra Jr., Mark S. Manasse, John M. Pollard
The Number Field Sieve STOC (1990)
Arjen K. Lenstra, Mark S. Manasse
Factoring by Electronic Mail. EUROCRYPT (1989)

Arjen K. Lenstra.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Arjen K. Lenstra