| * | 2009 |
|---|
| 77 | EE | 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 |
| 76 | EE | Pascal Junod,
Alexandre Karlov,
Arjen K. Lenstra:
Improving the Boneh-Franklin Traitor Tracing Scheme.
Public Key Cryptography 2009: 88-104 |
| 2008 |
|---|
| 75 | | S. Hasan Mirjalili,
Arjen K. Lenstra:
Security Observance throughout the Life-Cycle of Embedded Systems.
ESA 2008: 186-192 |
| 2007 |
|---|
| 74 | | Juan A. Garay,
Arjen K. Lenstra,
Masahiro Mambo,
René Peralta:
Information Security, 10th International Conference, ISC 2007, Valparaíso, Chile, October 9-12, 2007, Proceedings
Springer 2007 |
| 73 | EE | Kazumaro Aoki,
Jens Franke,
Thorsten Kleinjung,
Arjen K. Lenstra,
Dag Arne Osvik:
A Kilobit Special Number Field Sieve Factorization.
ASIACRYPT 2007: 1-12 |
| 72 | EE | 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 |
| 2006 |
|---|
| 71 | EE | Scott Contini,
Arjen K. Lenstra,
Ron Steinfeld:
VSH, an Efficient and Provable Collision-Resistant Hash Function.
EUROCRYPT 2006: 165-182 |
| 70 | EE | Arjen K. Lenstra,
Dan Page,
Martijn Stam:
Discrete Logarithm Variants of VSH.
VIETCRYPT 2006: 229-242 |
| 2005 |
|---|
| 69 | EE | Arjen K. Lenstra,
Benne de Weger:
On the Possibility of Constructing Meaningful Hash Collisions for Public Keys.
ACISP 2005: 267-279 |
| 68 | EE | Arjen K. Lenstra,
Benjamin M. M. de Weger:
Twin RSA.
Mycrypt 2005: 222-228 |
| 67 | EE | Arjen K. Lenstra:
L-Notation.
Encyclopedia of Cryptography and Security 2005 |
| 66 | EE | Arjen K. Lenstra:
Birthday Paradox.
Encyclopedia of Cryptography and Security 2005 |
| 65 | EE | Arjen K. Lenstra:
Factoring Circuits.
Encyclopedia of Cryptography and Security 2005 |
| 64 | EE | Arjen K. Lenstra:
Integer Factoring.
Encyclopedia of Cryptography and Security 2005 |
| 63 | EE | Arjen K. Lenstra:
Smoothness Probability.
Encyclopedia of Cryptography and Security 2005 |
| 62 | EE | Arjen K. Lenstra:
Subgroup Cryptosystems.
Encyclopedia of Cryptography and Security 2005 |
| 2004 |
|---|
| 61 | EE | Arjen K. Lenstra,
Tim Voss:
Information Security Risk Assessment, Aggregation, and Mitigation.
ACISP 2004: 391-401 |
| 60 | EE | Arjen K. Lenstra:
Preface.
J. Cryptology 17(4): 233 (2004) |
| 59 | EE | Karen Aardal,
Arjen K. Lenstra:
Hard Equality Constrained Integer Knapsacks.
Math. Oper. Res. 29(3): 724-738 (2004) |
| 2003 |
|---|
| 58 | EE | Arjen K. Lenstra,
Eran Tromer,
Adi Shamir,
Wil Kortsmit,
Bruce Dodson,
James Hughes,
Paul C. Leyland:
Factoring Estimates for a 1024-Bit RSA Modulus.
ASIACRYPT 2003: 55-74 |
| 2002 |
|---|
| 57 | EE | Paul C. Leyland,
Arjen K. Lenstra,
Bruce Dodson,
Alec Muffett,
Samuel S. Wagstaff Jr.:
MPQS with Three Large Primes.
ANTS 2002: 446-460 |
| 56 | EE | Arjen K. Lenstra,
Adi Shamir,
Jim Tomlinson,
Eran Tromer:
Analysis of Bernstein's Factorization Circuit.
ASIACRYPT 2002: 1-26 |
| 55 | EE | Martijn Stam,
Arjen K. Lenstra:
Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions.
CHES 2002: 318-332 |
| 54 | EE | Karen Aardal,
Arjen K. Lenstra:
Hard Equality Constrained Integer Knapsacks.
IPCO 2002: 350-366 |
| 53 | EE | Arjen K. Lenstra,
Igor Shparlinski:
Selective Forgery of RSA Signatures with Fixed-Pattern Padding.
Public Key Cryptography 2002: 228-236 |
| 2001 |
|---|
| 52 | EE | Martijn Stam,
Arjen K. Lenstra:
Speeding Up XTR.
ASIACRYPT 2001: 125-143 |
| 51 | EE | Arjen K. Lenstra:
Unbelievable Security. Matching AES Security Using Public Key Systems.
ASIACRYPT 2001: 67-86 |
| 50 | EE | Arjen K. Lenstra,
Igor Shparlinski:
On the Security of Lenstra's Variant of DSA without Long Inversions.
Public Key Cryptography 2001: 64-72 |
| 49 | EE | Arjen K. Lenstra,
Eric R. Verheul:
Fast Irreducibility and Subgroup Membership Testing in XTR.
Public Key Cryptography 2001: 73-86 |
| 48 | EE | Arjen K. Lenstra,
Eric R. Verheul:
Selecting Cryptographic Key Sizes.
J. Cryptology 14(4): 255-293 (2001) |
| 2000 |
|---|
| 47 | EE | Arjen K. Lenstra,
Eric R. Verheul:
Key Improvements to XTR.
ASIACRYPT 2000: 220-233 |
| 46 | EE | Arjen K. Lenstra,
Eric R. Verheul:
The XTR Public Key System.
CRYPTO 2000: 1-19 |
| 45 | EE | Stefania Cavallar,
Bruce Dodson,
Arjen K. Lenstra,
Walter M. Lioen,
Peter L. Montgomery,
Brian Murphy,
Herman 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 |
| 44 | EE | Arjen K. Lenstra,
Adi Shamir:
Analysis and Optimization of the TWINKLE Factoring Device.
EUROCRYPT 2000: 35-52 |
| 43 | | Arjen K. Lenstra,
Eric R. Verheul:
Selecting Cryptographic Key Sizes.
Public Key Cryptography 2000: 446-465 |
| 42 | | Arjen K. Lenstra,
Eric R. Verheul:
Selecting Cryptographic Key Sizes.
Datenschutz und Datensicherheit 24(3): (2000) |
| 41 | | Arjen K. Lenstra:
Integer Factoring.
Des. Codes Cryptography 19(2/3): 101-128 (2000) |
| 40 | EE | 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) |
| 39 | EE | 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) |
| 1999 |
|---|
| 38 | EE | Arjen K. Lenstra:
Efficient Identity Based Parameter Selection for Elliptic Curve Cryptosystems.
ACISP 1999: 294-302 |
| 37 | EE | Stefania Cavallar,
Bruce Dodson,
Arjen K. Lenstra,
Paul C. Leyland,
Walter M. Lioen,
Peter L. Montgomery,
Brian Murphy,
Herman te Riele,
Paul Zimmermann:
Factorization of RSA-140 Using the Number Field Sieve.
ASIACRYPT 1999: 195-207 |
| 36 | EE | 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 |
| 35 | EE | Marc Joye,
Arjen K. Lenstra,
Jean-Jacques Quisquater:
Chinese Remaindering Based Cryptosystems in the Presence of Faults.
J. Cryptology 12(4): 241-245 (1999) |
| 1998 |
|---|
| 34 | EE | Arjen K. Lenstra:
Generating RSA Moduli with a Predetermined Portion.
ASIACRYPT 1998: 1-10 |
| 33 | EE | 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 |
| 1997 |
|---|
| 32 | | Arjen K. Lenstra:
Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems Over Finite Fields.
ACISP 1997: 127-138 |
| 1996 |
|---|
| 31 | EE | 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 |
| 30 | EE | Arjen K. Lenstra:
Generating Standard DSA Signatures Without Long Inversion.
ASIACRYPT 1996: 57-64 |
| 29 | EE | Arjen K. Lenstra:
Securing the Net - The Fruits of Incompetence.
First Monday 1(4): (1996) |
| 1995 |
|---|
| 28 | EE | Arjen K. Lenstra,
Peter Winkler,
Yacov Yacobi:
A Key Escrow System with Warrant Bounds.
CRYPTO 1995: 197-207 |
| 27 | EE | Bruce Dodson,
Arjen K. Lenstra:
NFS with Four Large Primes: An Explosive Experiment.
CRYPTO 1995: 372-385 |
| 26 | EE | Daniel Bleichenbacher,
Wieb Bosma,
Arjen K. Lenstra:
Some Remarks on Lucas-Based Cryptosystems.
CRYPTO 1995: 386-396 |
| 1994 |
|---|
| 25 | | Roger A. Golliver,
Arjen K. Lenstra,
Kevin S. McCurley:
Lattice sieving and trial division.
ANTS 1994: 18-27 |
| 24 | EE | Derek Atkins,
Michael Graff,
Arjen K. Lenstra,
Paul C. Leyland:
The Magic Words are Squeamish Ossifrage.
ASIACRYPT 1994: 263-277 |
| 23 | EE | Arjen K. Lenstra:
Factoring.
WDAG 1994: 28-38 |
| 1993 |
|---|
| 22 | EE | Thomas F. Denny,
Bruce Dodson,
Arjen K. Lenstra,
Mark S. Manasse:
On the Factorization of RSA-120.
CRYPTO 1993: 166-174 |
| 21 | EE | Brandon Dixon,
Arjen K. Lenstra:
Factoring Integers Using SIMD Sieves.
EUROCRYPT 1993: 28-39 |
| 20 | | Arjen K. Lenstra,
Yacov Yacobi:
User Impersonation in Key Certification Schemes.
J. Cryptology 6(4): 225-232 (1993) |
| 1992 |
|---|
| 19 | EE | Brandon Dixon,
Arjen K. Lenstra:
Massively Parallel Elliptic Curve Factorin.
EUROCRYPT 1992: 183-193 |
| 18 | EE | 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 |
| 17 | | Arjen K. Lenstra:
Massively Parallel Computing and Factoring.
LATIN 1992: 344-355 |
| 1990 |
|---|
| 16 | EE | Arjen K. Lenstra,
Mark S. Manasse:
Factoring With Two Large Primes.
EUROCRYPT 1990: 72-82 |
| 15 | | Arjen K. Lenstra,
Hendrik W. Lenstra Jr.,
Mark S. Manasse,
John M. Pollard:
The Number Field Sieve
STOC 1990: 564-572 |
| 14 | | 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 |
| 1989 |
|---|
| 13 | EE | Arjen K. Lenstra,
Mark S. Manasse:
Factoring by Electronic Mail.
EUROCRYPT 1989: 355-371 |
| 1987 |
|---|
| 12 | | Arjen K. Lenstra:
Factoring Multivariate Polynomials over Algebraic Number Fields.
SIAM J. Comput. 16(3): 591-598 (1987) |
| 1985 |
|---|
| 11 | | Marc-Paul van der Hulst,
Arjen K. Lenstra:
Factorization of Polynominals by Transcendental Evaluation.
European Conference on Computer Algebra (2) 1985: 138-145 |
| 10 | | Arjen K. Lenstra:
Factoring Multivariate Polynomials over Finite Fields.
J. Comput. Syst. Sci. 30(2): 235-248 (1985) |
| 1984 |
|---|
| 9 | | Arjen K. Lenstra:
Polynomial Factorization by Root Approximation.
EUROSAM 1984: 272-276 |
| 8 | EE | Arjen K. Lenstra:
Factoring Multivariate Polynomials over Algebraic Number Fields.
MFCS 1984: 389-396 |
| 7 | | 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 |
| 6 | | Arjen K. Lenstra:
Polynomial - time algorithms for the factorization of polynomials.
Bulletin of the EATCS 23: 59-75 (1984) |
| 5 | | Arjen K. Lenstra:
Factoring Multivariate Integral Polynomials.
Theor. Comput. Sci. 34: 207-213 (1984) |
| 1983 |
|---|
| 4 | | Arjen K. Lenstra:
Factoring polynominals over algebraic number fields.
EUROCAL 1983: 245-254 |
| 3 | EE | Arjen K. Lenstra:
Factoring Multivariate Integral Polynomials.
ICALP 1983: 458-465 |
| 2 | | Arjen K. Lenstra:
Factoring Multivariate Polynomials over Finite Fields (Extended Abstract)
STOC 1983: 189-192 |
| 1982 |
|---|
| 1 | | Arjen K. Lenstra:
Lattices and Factorization of Polynomials over Algebraic Number Fields.
EUROCAM 1982: 32-39 |
