Arjen K. Lenstra
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
54
Venues
15
Active years
1983–2017
Best venue rank
A*
Where they publish
Papers
54 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2017 | EuroCrypt | Computation of a 768-Bit Prime Field Discrete Logarithm. | Thorsten Kleinjung, Claus Diem, Arjen K. Lenstra, Christine Priplata, Colin Stahlke |
| 2017 | ISSAC | Parametrizations for Families of ECM-Friendly Curves. | Alexandre Glin, Thorsten Kleinjung, Arjen K. Lenstra |
| 2015 | ISIT | STEP-archival: Storage integrity and anti-tampering using data entanglement. | Hugues Mercier, Maxime Augier, Arjen K. Lenstra |
| 2014 | ASIACRYPT | Mersenne Factorization Factory. | Thorsten Kleinjung, Joppe W. Bos, Arjen K. Lenstra |
| 2014 | CHES | Cofactorization on Graphics Processing Units. | Andrea Miele, Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra |
| 2012 | CRYPTO | Public Keys. | Arjen K. Lenstra, James P. Hughes, Maxime Augier, Joppe W. Bos, Thorsten Kleinjung, Christophe Wachter |
| 2012 | INDOCRYPT | Using the Cloud to Determine Key Strengths. | Thorsten Kleinjung, Arjen K. Lenstra, Dan Page, Nigel P. Smart |
| 2011 | ARITH | Efficient SIMD Arithmetic Modulo a Mersenne Number. | Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery |
| 2010 | CRYPTO | Factorization of a 768-Bit RSA Modulus. | 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 |
| 2009 | CRYPTO | Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate. | Marc Stevens, Alexander Sotirov, Jacob Appelbaum, Arjen K. Lenstra, David Molnar, Dag Arne Osvik, Benne de Weger |
| 2009 | PKC | Improving the Boneh-Franklin Traitor Tracing Scheme. | Pascal Junod, Alexandre Karlov, Arjen K. Lenstra |
| 2007 | ASIACRYPT | A Kilobit Special Number Field Sieve Factorization. | Kazumaro Aoki, Jens Franke, Thorsten Kleinjung, Arjen K. Lenstra, Dag Arne Osvik |
| 2007 | EuroCrypt | Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities. | Marc Stevens, Arjen K. Lenstra, Benne de Weger |
| 2006 | EuroCrypt | VSH, an Efficient and Provable Collision-Resistant Hash Function. | Scott Contini, Arjen K. Lenstra, Ron Steinfeld |
| 2005 | ACISP | On the Possibility of Constructing Meaningful Hash Collisions for Public Keys. | Arjen K. Lenstra, Benne de Weger |
| 2004 | ACISP | Information Security Risk Assessment, Aggregation, and Mitigation. | Arjen K. Lenstra, Tim Voss |
| 2003 | ASIACRYPT | Factoring Estimates for a 1024-Bit RSA Modulus. | Arjen K. Lenstra, Eran Tromer, Adi Shamir, Wil Kortsmit, Bruce Dodson, James P. Hughes, Paul C. Leyland |
| 2002 | ASIACRYPT | Analysis of Bernstein's Factorization Circuit. | Arjen K. Lenstra, Adi Shamir, Jim Tomlinson, Eran Tromer |
| 2002 | CHES | Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions. | Martijn Stam, Arjen K. Lenstra |
| 2002 | IPCO | Hard Equality Constrained Integer Knapsacks. | Karen I. Aardal, Arjen K. Lenstra |
| 2002 | PKC | Selective Forgery of RSA Signatures with Fixed-Pattern Padding. | Arjen K. Lenstra, Igor E. Shparlinski |
| 2001 | ASIACRYPT | Unbelievable Security. Matching AES Security Using Public Key Systems. | Arjen K. Lenstra |
| 2001 | ASIACRYPT | Speeding Up XTR. | Martijn Stam, Arjen K. Lenstra |
| 2001 | PKC | On the Security of Lenstra's Variant of DSA without Long Inversions. | Arjen K. Lenstra, Igor E. Shparlinski |
| 2001 | PKC | Fast Irreducibility and Subgroup Membership Testing in XTR. | Arjen K. Lenstra, Eric R. Verheul |
| 2000 | ASIACRYPT | Key Improvements to XTR. | Arjen K. Lenstra, Eric R. Verheul |
| 2000 | CRYPTO | The XTR Public Key System. | Arjen K. Lenstra, Eric R. Verheul |
| 2000 | EuroCrypt | Factorization of a 512-Bit RSA Modulus. | Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman J. J. te Riele, Karen I. Aardal, Jeff Gilchrist, Grard Guillerm, Paul C. Leyland, Jol Marchand, Franois Morain, Alec Muffett, Chris Putnam, Craig Putnam, Paul Zimmermann |
| 2000 | EuroCrypt | Analysis and Optimization of the TWINKLE Factoring Device. | Arjen K. Lenstra, Adi Shamir |
| 2000 | PKC | Selecting Cryptographic Key Sizes. | Arjen K. Lenstra, Eric R. Verheul |
| 1999 | ACISP | Efficient Identity Based Parameter Selection for Elliptic Curve Cryptosystems. | Arjen K. Lenstra |
| 1999 | ASIACRYPT | Factorization of RSA-140 Using the Number Field Sieve. | 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 |
| 1999 | IPCO | Market Split and Basis Reduction: Towards a Solution of the Cornujols-Dawande Instances. | Karen I. Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink |
| 1998 | ASIACRYPT | Generating RSA Moduli with a Predetermined Portion. | Arjen K. Lenstra |
| 1998 | IPCO | Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables. | Karen I. Aardal, Cor A. J. Hurkens, Arjen K. Lenstra |
| 1997 | ACISP | Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems Over Finite Fields. | Arjen K. Lenstra |
| 1996 | ASIACRYPT | A World Wide Number Field Sieve Factoring Record: On to 512 Bits. | James Cowie, Bruce Dodson, R. Marije Elkenbracht-Huizing, Arjen K. Lenstra, Peter L. Montgomery, Jrg Zayer |
| 1996 | ASIACRYPT | Generating Standard DSA Signatures Without Long Inversion. | Arjen K. Lenstra |
| 1995 | CRYPTO | Some Remarks on Lucas-Based Cryptosystems. | Daniel Bleichenbacher, Wieb Bosma, Arjen K. Lenstra |
| 1995 | CRYPTO | NFS with Four Large Primes: An Explosive Experiment. | Bruce Dodson, Arjen K. Lenstra |
| 1995 | CRYPTO | A Key Escrow System with Warrant Bounds. | Arjen K. Lenstra, Peter Winkler, Yacov Yacobi |
| 1994 | ASIACRYPT | The Magic Words are Squeamish Ossifrage. | Derek Atkins, Michael Graff, Arjen K. Lenstra, Paul C. Leyland |
| 1993 | CRYPTO | On the Factorization of RSA-120. | Thomas F. Denny, Bruce Dodson, Arjen K. Lenstra, Mark S. Manasse |
| 1993 | EuroCrypt | Factoring Integers Using SIMD Sieves. | Brandon Dixon, Arjen K. Lenstra |
| 1992 | EuroCrypt | The Eurocrypt '92 Controversial Issue: Trapdoor Primes and Moduli (Panel). | Yvo Desmedt, Peter Landrock, Arjen K. Lenstra, Kevin S. McCurley, Andrew M. Odlyzko, Rainer A. Rueppel, Miles E. Smid |
| 1992 | EuroCrypt | Massively Parallel Elliptic Curve Factorin. | Brandon Dixon, Arjen K. Lenstra |
| 1992 | LATIN | Massively Parallel Computing and Factoring. | Arjen K. Lenstra |
| 1990 | EuroCrypt | Factoring With Two Large Primes. | Arjen K. Lenstra, Mark S. Manasse |
| 1990 | STOC | The Number Field Sieve | Arjen K. Lenstra, Hendrik W. Lenstra Jr., Mark S. Manasse, John M. Pollard |
| 1989 | EuroCrypt | Factoring by Electronic Mail. | Arjen K. Lenstra, Mark S. Manasse |
| 1984 | MFCS | Factoring Multivariate Polynomials over Algebraic Number Fields. | Arjen K. Lenstra |
| 1984 | STOC | Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers | Ravindran Kannan, Arjen K. Lenstra, Lszl Lovsz |
| 1983 | ICALP | Factoring Multivariate Integral Polynomials. | Arjen K. Lenstra |
| 1983 | STOC | Factoring Multivariate Polynomials over Finite Fields (Extended Abstract) | Arjen K. Lenstra |