Arjen K. Lenstra

124 papers A* 21A 14B 7C 3Misc 5Journal 46Unranked 19

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Delphi: sharing assessments of cryptographic assumptions. IACR Cryptol. ePrint Arch. Jeroen van de Graaf, Arjen K. Lenstra
2021	J	`jnl`	Computation of a 30750-bit binary field discrete logarithm. Math. Comput. Robert Granger, Thorsten Kleinjung, Arjen K. Lenstra, Benjamin Wesolowski, Jens Zumbrägel
2020	J	`jnl`	Computation of a 30750-Bit Binary Field Discrete Logarithm. IACR Cryptol. ePrint Arch. Robert Granger, Thorsten Kleinjung, Arjen K. Lenstra, Benjamin Wesolowski, Jens Zumbrägel
2018	J	`jnl`	STeP-Archival: Storage Integrity and Tamper Resistance Using Data Entanglement. IEEE Trans. Inf. Theory Hugues Mercier, Maxime Augier, Arjen K. Lenstra
2018	J	`jnl`	Using the Cloud to Determine Key Strengths - Triennial Update. IACR Cryptol. ePrint Arch. Marguerite Delcourt, Thorsten Kleinjung, Arjen K. Lenstra, Shubhojyoti Nath, Dan Page, Nigel P. Smart
2017	—	`conf`	Computation of a 768-Bit Prime Field Discrete Logarithm. EUROCRYPT (1) Thorsten Kleinjung, Claus Diem, Arjen K. Lenstra, Christine Priplata, Colin Stahlke
2017	J	`jnl`	Computation of a 768-bit prime field discrete logarithm. IACR Cryptol. ePrint Arch. Thorsten Kleinjung, Claus Diem, Arjen K. Lenstra, Christine Priplata, Colin Stahlke
2017	J	`jnl`	General purpose integer factoring. IACR Cryptol. ePrint Arch. Arjen K. Lenstra
2017	B	`conf`	Parametrizations for Families of ECM-Friendly Curves. ISSAC Alexandre Gélin, Thorsten Kleinjung, Arjen K. Lenstra
2017	J	`jnl`	Trustworthy public randomness with sloth, unicorn, and trx. Int. J. Appl. Cryptogr. Arjen K. Lenstra, Benjamin Wesolowski
2016	J	`jnl`	Parametrizations for Families of ECM-friendly curves. IACR Cryptol. ePrint Arch. Alexandre Gélin, Thorsten Kleinjung, Arjen K. Lenstra
2015	J	`jnl`	A random zoo: sloth, unicorn, and trx. IACR Cryptol. ePrint Arch. Arjen K. Lenstra, Benjamin Wesolowski
2015	C	`conf`	Efficient Ephemeral Elliptic Curve Cryptographic Keys. ISC Andrea Miele, Arjen K. Lenstra
2015	J	`jnl`	Efficient ephemeral elliptic curve cryptographic keys. IACR Cryptol. ePrint Arch. Andrea Miele, Arjen K. Lenstra
2015	B	`conf`	STEP-archival: Storage integrity and anti-tampering using data entanglement. ISIT Hugues Mercier, Maxime Augier, Arjen K. Lenstra
2014	A	`conf`	Cofactorization on Graphics Processing Units. CHES Andrea Miele, Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra
2014	J	`jnl`	Cofactorization on Graphics Processing Units. IACR Cryptol. ePrint Arch. Andrea Miele, Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra
2014	—	`conf`	Mersenne Factorization Factory. ASIACRYPT (1) Thorsten Kleinjung, Joppe W. Bos, Arjen K. Lenstra
2014	J	`jnl`	Mersenne factorization factory. IACR Cryptol. ePrint Arch. Thorsten Kleinjung, Joppe W. Bos, Arjen K. Lenstra
2013	—	`conf`	Universal Security - From Bits and Mips to Pools, Lakes - and Beyond. Number Theory and Cryptography Arjen K. Lenstra, Thorsten Kleinjung, Emmanuel Thomé
2013	J	`jnl`	Universal security; from bits and mips to pools, lakes - and beyond. IACR Cryptol. ePrint Arch. Arjen K. Lenstra, Thorsten Kleinjung, Emmanuel Thomé
2012	J	`jnl`	A heterogeneous computing environment to solve the 768-bit RSA challenge. Clust. Comput. 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
2012	J	`jnl`	Chosen-prefix collisions for MD5 and applications. Int. J. Appl. Cryptogr. Marc Stevens, Arjen K. Lenstra, Benne de Weger
2012	A*	`conf`	Public Keys. CRYPTO Arjen K. Lenstra, James P. Hughes, Maxime Augier, Joppe W. Bos, Thorsten Kleinjung, Christophe Wachter
2012	J	`jnl`	Ron was wrong, Whit is right. IACR Cryptol. ePrint Arch. Arjen K. Lenstra, James P. Hughes, Maxime Augier, Joppe W. Bos, Thorsten Kleinjung, Christophe Wachter
2012	J	`jnl`	Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction. Int. J. Appl. Cryptogr. Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery
2012	Misc	`conf`	Using the Cloud to Determine Key Strengths. INDOCRYPT Thorsten Kleinjung, Arjen K. Lenstra, Dan Page, Nigel P. Smart
2011	—	`ch.`	Birthday Paradox. Encyclopedia of Cryptography and Security (2nd Ed.) Arjen K. Lenstra
2011	C	`conf`	Efficient SIMD Arithmetic Modulo a Mersenne Number. IEEE Symposium on Computer Arithmetic Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery
2011	—	`ch.`	Integer Factoring. Encyclopedia of Cryptography and Security (2nd Ed.) Arjen K. Lenstra
2011	J	`jnl`	Using the Cloud to Determine Key Strengths. IACR Cryptol. ePrint Arch. Thorsten Kleinjung, Arjen K. Lenstra, Dan Page, Nigel P. Smart
2010	J	`jnl`	Efficient SIMD arithmetic modulo a Mersenne number. IACR Cryptol. ePrint Arch. Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery
2010	A*	`conf`	Factorization of a 768-Bit RSA Modulus. CRYPTO 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
2010	J	`jnl`	Factorization of a 768-bit RSA modulus. IACR Cryptol. ePrint Arch. 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
2010	—	`conf`	On the Use of the Negation Map in the Pollard Rho Method. ANTS Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra
2010	—	`ch.`	The History of the LLL-Algorithm. The LLL Algorithm Ionica Smeets, Arjen K. Lenstra, Hendrik Lenstra, László Lovász, Peter van Emde Boas
2010	—	`conf`	Towards a Structural Secure Design Process. SECURWARE S. Hasan Mirjalili, Arjen K. Lenstra
2009	—	`conf`	Improving the Boneh-Franklin Traitor Tracing Scheme. Public Key Cryptography Pascal Junod, Alexandre Karlov, Arjen K. Lenstra
2009	J	`jnl`	On the Security of 1024-bit RSA and 160-bit Elliptic Curve Cryptography. IACR Cryptol. ePrint Arch. Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery
2009	A*	`conf`	Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate. CRYPTO Marc Stevens, Alexander Sotirov, Jacob Appelbaum, Arjen K. Lenstra, David Molnar, Dag Arne Osvik, Benne de Weger
2009	J	`jnl`	Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate. IACR Cryptol. ePrint Arch. Marc Stevens, Alexander Sotirov, Jacob Appelbaum, Arjen K. Lenstra, David Molnar, Dag Arne Osvik, Benne de Weger
2008	J	`jnl`	Improving the Boneh-Franklin Traitor Tracing Scheme. IACR Cryptol. ePrint Arch. Pascal Junod, Alexandre Karlov, Arjen K. Lenstra
2008	A	`conf`	Security Observance throughout the Life-Cycle of Embedded Systems. ESA S. Hasan Mirjalili, Arjen K. Lenstra
2007	A	`conf`	A Kilobit Special Number Field Sieve Factorization. ASIACRYPT Kazumaro Aoki, Jens Franke, Thorsten Kleinjung, Arjen K. Lenstra, Dag Arne Osvik
2007	J	`jnl`	A kilobit special number field sieve factorization. IACR Cryptol. ePrint Arch. Kazumaro Aoki, Jens Franke, Thorsten Kleinjung, Arjen K. Lenstra, Dag Arne Osvik
2007	A*	`conf`	Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities. EUROCRYPT Marc Stevens, Arjen K. Lenstra, Benne de Weger
2007	C	`ed.`	Information Security, 10th International Conference, ISC 2007, Valparaíso, Chile, October 9-12, 2007, Proceedings ISC Juan A. Garay, Arjen K. Lenstra, Masahiro Mambo, René Peralta
2006	—	`conf`	Discrete Logarithm Variants of VSH. VIETCRYPT Arjen K. Lenstra, Dan Page, Martijn Stam
2006	J	`jnl`	Target Collisions for MD5 and Colliding X.509 Certificates for Different Identities. IACR Cryptol. ePrint Arch. Marc Stevens, Arjen K. Lenstra, Benne de Weger
2006	A*	`conf`	VSH, an Efficient and Provable Collision-Resistant Hash Function. EUROCRYPT Scott Contini, Arjen K. Lenstra, Ron Steinfeld
2005	—	`ch.`	Birthday Paradox. Encyclopedia of Cryptography and Security Arjen K. Lenstra
2005	J	`jnl`	Colliding X.509 Certificates. IACR Cryptol. ePrint Arch. Arjen K. Lenstra, Xiaoyun Wang, Benne de Weger
2005	—	`ch.`	Factoring Circuits. Encyclopedia of Cryptography and Security Arjen K. Lenstra
2005	—	`ch.`	Integer Factoring. Encyclopedia of Cryptography and Security Arjen K. Lenstra
2005	Misc	`conf`	On the Possibility of Constructing Meaningful Hash Collisions for Public Keys. ACISP Arjen K. Lenstra, Benne de Weger
2005	—	`ch.`	Smoothness Probability. Encyclopedia of Cryptography and Security Arjen K. Lenstra
2005	—	`ch.`	Subgroup Cryptosystems. Encyclopedia of Cryptography and Security Arjen K. Lenstra
2005	—	`conf`	Twin RSA. Mycrypt Arjen K. Lenstra, Benjamin M. M. de Weger
2005	J	`jnl`	Twin RSA. IACR Cryptol. ePrint Arch. Arjen K. Lenstra, Benjamin M. M. de Weger
2005	J	`jnl`	VSH, an Efficient and Provable Collision Resistant Hash Function. IACR Cryptol. ePrint Arch. Scott Contini, Arjen K. Lenstra, Ron Steinfeld
2004	J	`jnl`	Hard Equality Constrained Integer Knapsacks. Math. Oper. Res. Karen I. Aardal, Arjen K. Lenstra
2004	Misc	`conf`	Information Security Risk Assessment, Aggregation, and Mitigation. ACISP Arjen K. Lenstra, Tim Voss
2004	J	`jnl`	Preface. J. Cryptol. Arjen K. Lenstra
2003	A	`conf`	Factoring Estimates for a 1024-Bit RSA Modulus. ASIACRYPT Arjen K. Lenstra, Eran Tromer, Adi Shamir, Wil Kortsmit, Bruce Dodson, James P. Hughes, Paul C. Leyland
2002	A	`conf`	Analysis of Bernstein's Factorization Circuit. ASIACRYPT Arjen K. Lenstra, Adi Shamir, Jim Tomlinson, Eran Tromer
2002	A	`conf`	Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions. CHES Martijn Stam, Arjen K. Lenstra
2002	B	`conf`	Hard Equality Constrained Integer Knapsacks. IPCO Karen I. Aardal, Arjen K. Lenstra
2002	—	`conf`	MPQS with Three Large Primes. ANTS Paul C. Leyland, Arjen K. Lenstra, Bruce Dodson, Alec Muffett, Samuel S. Wagstaff Jr.
2002	—	`conf`	Selective Forgery of RSA Signatures with Fixed-Pattern Padding. Public Key Cryptography Arjen K. Lenstra, Igor E. Shparlinski
2001	—	`conf`	Fast Irreducibility and Subgroup Membership Testing in XTR. Public Key Cryptography Arjen K. Lenstra, Eric R. Verheul
2001	—	`conf`	On the Security of Lenstra's Variant of DSA without Long Inversions. Public Key Cryptography Arjen K. Lenstra, Igor E. Shparlinski
2001	J	`jnl`	Selecting Cryptographic Key Sizes. J. Cryptol. Arjen K. Lenstra, Eric R. Verheul
2001	A	`conf`	Speeding Up XTR. ASIACRYPT Martijn Stam, Arjen K. Lenstra
2001	A	`conf`	Unbelievable Security. Matching AES Security Using Public Key Systems. ASIACRYPT Arjen K. Lenstra
2000	A*	`conf`	Analysis and Optimization of the TWINKLE Factoring Device. EUROCRYPT Arjen K. Lenstra, Adi Shamir
2000	A*	`conf`	Factorization of a 512-Bit RSA Modulus. EUROCRYPT 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, Gérard Guillerm, Paul C. Leyland, Joël Marchand, François Morain, Alec Muffett, Chris Putnam, Craig Putnam, Paul Zimmermann
2000	J	`jnl`	Integer Factoring. Des. Codes Cryptogr. Arjen K. Lenstra
2000	A	`conf`	Key Improvements to XTR. ASIACRYPT Arjen K. Lenstra, Eric R. Verheul
2000	J	`jnl`	Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances. INFORMS J. Comput. Karen I. Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink
2000	—	`conf`	Selecting Cryptographic Key Sizes. Public Key Cryptography Arjen K. Lenstra, Eric R. Verheul
2000	J	`jnl`	Selecting Cryptographic Key Sizes. Datenschutz und Datensicherheit Arjen K. Lenstra, Eric R. Verheul
2000	J	`jnl`	Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables. Math. Oper. Res. Karen I. Aardal, Cor A. J. Hurkens, Arjen K. Lenstra
2000	A*	`conf`	The XTR Public Key System. CRYPTO Arjen K. Lenstra, Eric R. Verheul
1999	J	`jnl`	Chinese Remaindering Based Cryptosystems in the Presence of Faults. J. Cryptol. Marc Joye, Arjen K. Lenstra, Jean-Jacques Quisquater
1999	Misc	`conf`	Efficient Identity Based Parameter Selection for Elliptic Curve Cryptosystems. ACISP Arjen K. Lenstra
1999	A	`conf`	Factorization of RSA-140 Using the Number Field Sieve. ASIACRYPT 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	B	`conf`	Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances. IPCO Karen I. Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink
1998	A	`conf`	Generating RSA Moduli with a Predetermined Portion. ASIACRYPT Arjen K. Lenstra
1998	B	`conf`	Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables. IPCO Karen I. Aardal, Cor A. J. Hurkens, Arjen K. Lenstra
1997	Misc	`conf`	Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems Over Finite Fields. ACISP Arjen K. Lenstra
1996	A	`conf`	A World Wide Number Field Sieve Factoring Record: On to 512 Bits. ASIACRYPT James Cowie, Bruce Dodson, R. Marije Elkenbracht-Huizing, Arjen K. Lenstra, Peter L. Montgomery, Jörg Zayer
1996	A	`conf`	Generating Standard DSA Signatures Without Long Inversion. ASIACRYPT Arjen K. Lenstra
1996	J	`jnl`	Securing the Net - The Fruits of Incompetence. First Monday Arjen K. Lenstra
1995	A*	`conf`	A Key Escrow System with Warrant Bounds. CRYPTO Arjen K. Lenstra, Peter Winkler, Yacov Yacobi
1995	A*	`conf`	NFS with Four Large Primes: An Explosive Experiment. CRYPTO Bruce Dodson, Arjen K. Lenstra
1995	A*	`conf`	Some Remarks on Lucas-Based Cryptosystems. CRYPTO Daniel Bleichenbacher, Wieb Bosma, Arjen K. Lenstra
1994	—	`conf`	Factoring. WDAG Arjen K. Lenstra
1994	—	`conf`	Lattice sieving and trial division. ANTS Roger A. Golliver, Arjen K. Lenstra, Kevin S. McCurley
1994	A	`conf`	The Magic Words are Squeamish Ossifrage. ASIACRYPT Derek Atkins, Michael Graff, Arjen K. Lenstra, Paul C. Leyland
1993	A*	`conf`	Factoring Integers Using SIMD Sieves. EUROCRYPT Brandon Dixon, Arjen K. Lenstra
1993	A*	`conf`	On the Factorization of RSA-120. CRYPTO Thomas F. Denny, Bruce Dodson, Arjen K. Lenstra, Mark S. Manasse
1993	J	`jnl`	User Impersonation in Key Certification Schemes. J. Cryptol. Arjen K. Lenstra, Yacov Yacobi
1993	J	`jnl`	Uses of Randomness in Algorithms and Protocols (Joe Kilian). SIAM Rev. Arjen K. Lenstra
1992	B	`conf`	Massively Parallel Computing and Factoring. LATIN Arjen K. Lenstra
1992	A*	`conf`	Massively Parallel Elliptic Curve Factorin. EUROCRYPT Brandon Dixon, Arjen K. Lenstra
1992	A*	`conf`	The Eurocrypt '92 Controversial Issue: Trapdoor Primes and Moduli (Panel). EUROCRYPT Yvo Desmedt, Peter Landrock, Arjen K. Lenstra, Kevin S. McCurley, Andrew M. Odlyzko, Rainer A. Rueppel, Miles E. Smid
1990	—	`ch.`	Algorithms in Number Theory. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) Arjen K. Lenstra, Hendrik W. Lenstra Jr.
1990	A*	`conf`	Factoring With Two Large Primes. EUROCRYPT Arjen K. Lenstra, Mark S. Manasse
1990	A*	`conf`	The Number Field Sieve STOC Arjen K. Lenstra, Hendrik W. Lenstra Jr., Mark S. Manasse, John M. Pollard
1989	A*	`conf`	Factoring by Electronic Mail. EUROCRYPT Arjen K. Lenstra, Mark S. Manasse
1987	J	`jnl`	Factoring Multivariate Polynomials over Algebraic Number Fields. SIAM J. Comput. Arjen K. Lenstra
1985	J	`jnl`	Factoring Multivariate Polynomials over Finite Fields. J. Comput. Syst. Sci. Arjen K. Lenstra
1985	—	`conf`	Factorization of Polynominals by Transcendental Evaluation. European Conference on Computer Algebra (2) Marc-Paul van der Hulst, Arjen K. Lenstra
1984	J	`jnl`	Factoring Multivariate Integral Polynomials. Theor. Comput. Sci. Arjen K. Lenstra
1984	B	`conf`	Factoring Multivariate Polynomials over Algebraic Number Fields. MFCS Arjen K. Lenstra
1984	J	`jnl`	Factorization of polynomials. SIGSAM Bull. Arjen K. Lenstra
1984	J	`jnl`	Polynomial - time algorithms for the factorization of polynomials. Bull. EATCS Arjen K. Lenstra
1984	A*	`conf`	Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers STOC Ravindran Kannan, Arjen K. Lenstra, László Lovász
1984	—	`conf`	Polynomial Factorization by Root Approximation. EUROSAM Arjen K. Lenstra
1983	A*	`conf`	Factoring Multivariate Integral Polynomials. ICALP Arjen K. Lenstra
1983	A*	`conf`	Factoring Multivariate Polynomials over Finite Fields (Extended Abstract) STOC Arjen K. Lenstra
1983	—	`conf`	Factoring polynominals over algebraic number fields. EUROCAL Arjen K. Lenstra
1982	—	`conf`	Lattices and Factorization of Polynomials over Algebraic Number Fields. EUROCAM Arjen K. Lenstra
1981	J	`jnl`	Lattices and factorization of polynomials. SIGSAM Bull. Arjen K. Lenstra