Arjen K. Lenstra

According to our database1, Arjen K. Lenstra authored at least 119 papers between 1981 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
STeP-Archival: Storage Integrity and Tamper Resistance Using Data Entanglement.
IEEE Trans. Information Theory, 2018

Using the Cloud to Determine Key Strengths - Triennial Update.
IACR Cryptology ePrint Archive, 2018

2017
Trustworthy public randomness with sloth, unicorn, and trx.
IJACT, 2017

General purpose integer factoring.
IACR Cryptology ePrint Archive, 2017

Computation of a 768-bit prime field discrete logarithm.
IACR Cryptology ePrint Archive, 2017

Parametrizations for Families of ECM-Friendly Curves.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

Computation of a 768-Bit Prime Field Discrete Logarithm.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

2016
Parametrizations for Families of ECM-friendly curves.
IACR Cryptology ePrint Archive, 2016

2015
Efficient ephemeral elliptic curve cryptographic keys.
IACR Cryptology ePrint Archive, 2015

A random zoo: sloth, unicorn, and trx.
IACR Cryptology ePrint Archive, 2015

Efficient Ephemeral Elliptic Curve Cryptographic Keys.
Proceedings of the Information Security - 18th International Conference, 2015

STEP-archival: Storage integrity and anti-tampering using data entanglement.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Cofactorization on Graphics Processing Units.
IACR Cryptology ePrint Archive, 2014

Mersenne factorization factory.
IACR Cryptology ePrint Archive, 2014

Cofactorization on Graphics Processing Units.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2014, 2014

Mersenne Factorization Factory.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013
Universal security; from bits and mips to pools, lakes - and beyond.
IACR Cryptology ePrint Archive, 2013

Universal Security - From Bits and Mips to Pools, Lakes - and Beyond.
Proceedings of the Number Theory and Cryptography, 2013

2012
Chosen-prefix collisions for MD5 and applications.
IJACT, 2012

Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction.
IJACT, 2012

Ron was wrong, Whit is right.
IACR Cryptology ePrint Archive, 2012

A heterogeneous computing environment to solve the 768-bit RSA challenge.
Cluster Computing, 2012

Using the Cloud to Determine Key Strengths.
Proceedings of the Progress in Cryptology, 2012

Public Keys.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

2011
L Notation.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Integer Factoring.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Birthday Paradox.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Using the Cloud to Determine Key Strengths.
IACR Cryptology ePrint Archive, 2011

Efficient SIMD Arithmetic Modulo a Mersenne Number.
Proceedings of the 20th IEEE Symposium on Computer Arithmetic, 2011

2010
The History of the LLL-Algorithm.
Proceedings of the LLL Algorithm - Survey and Applications, 2010

Factorization of a 768-bit RSA modulus.
IACR Cryptology ePrint Archive, 2010

Efficient SIMD arithmetic modulo a Mersenne number.
IACR Cryptology ePrint Archive, 2010

Towards a Structural Secure Design Process.
Proceedings of the Fourth International Conference on Emerging Security Information Systems and Technologies, 2010


On the Use of the Negation Map in the Pollard Rho Method.
Proceedings of the Algorithmic Number Theory, 9th International Symposium, 2010

2009
Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate.
IACR Cryptology ePrint Archive, 2009

On the Security of 1024-bit RSA and 160-bit Elliptic Curve Cryptography.
IACR Cryptology ePrint Archive, 2009

Improving the Boneh-Franklin Traitor Tracing Scheme.
Proceedings of the Public Key Cryptography, 2009

Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate.
Proceedings of the Advances in Cryptology, 2009

2008
Improving the Boneh-Franklin Traitor Tracing Scheme.
IACR Cryptology ePrint Archive, 2008

Security Observance throughout the Life-Cycle of Embedded Systems.
Proceedings of the 2008 International Conference on Embedded Systems & Applications, 2008

2007
A kilobit special number field sieve factorization.
IACR Cryptology ePrint Archive, 2007

Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities.
Proceedings of the Advances in Cryptology, 2007

A Kilobit Special Number Field Sieve Factorization.
Proceedings of the Advances in Cryptology, 2007

2006
Target Collisions for MD5 and Colliding X.509 Certificates for Different Identities.
IACR Cryptology ePrint Archive, 2006

Discrete Logarithm Variants of VSH.
Proceedings of the Progressin Cryptology, 2006

VSH, an Efficient and Provable Collision-Resistant Hash Function.
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

2005
Subgroup Cryptosystems.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Smoothness Probability.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Factoring Circuits.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Colliding X.509 Certificates.
IACR Cryptology ePrint Archive, 2005

Twin RSA.
IACR Cryptology ePrint Archive, 2005

VSH, an Efficient and Provable Collision Resistant Hash Function.
IACR Cryptology ePrint Archive, 2005

Twin RSA.
Proceedings of the Progress in Cryptology, 2005

On the Possibility of Constructing Meaningful Hash Collisions for Public Keys.
Proceedings of the Information Security and Privacy, 10th Australasian Conference, 2005

2004
Hard Equality Constrained Integer Knapsacks.
Math. Oper. Res., 2004

Preface.
J. Cryptology, 2004

Information Security Risk Assessment, Aggregation, and Mitigation.
Proceedings of the Information Security and Privacy: 9th Australasian Conference, 2004

2003
Factoring Estimates for a 1024-Bit RSA Modulus.
Proceedings of the Advances in Cryptology - ASIACRYPT 2003, 9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, November 30, 2003

2002
Selective Forgery of RSA Signatures with Fixed-Pattern Padding.
Proceedings of the Public Key Cryptography, 2002

Hard Equality Constrained Integer Knapsacks.
Proceedings of the Integer Programming and Combinatorial Optimization, 2002

Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2002

Analysis of Bernstein's Factorization Circuit.
Proceedings of the Advances in Cryptology, 2002

MPQS with Three Large Primes.
Proceedings of the Algorithmic Number Theory, 5th International Symposium, 2002

2001
Selecting Cryptographic Key Sizes.
J. Cryptology, 2001

Fast Irreducibility and Subgroup Membership Testing in XTR.
Proceedings of the Public Key Cryptography, 2001

On the Security of Lenstra's Variant of DSA without Long Inversions.
Proceedings of the Public Key Cryptography, 2001

Speeding Up XTR.
Proceedings of the Advances in Cryptology, 2001

Unbelievable Security. Matching AES Security Using Public Key Systems.
Proceedings of the Advances in Cryptology, 2001

2000
Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables.
Math. Oper. Res., 2000

Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances.
INFORMS Journal on Computing, 2000

Selecting Cryptographic Key Sizes.
Datenschutz und Datensicherheit, 2000

Integer Factoring.
Des. Codes Cryptogr., 2000

Selecting Cryptographic Key Sizes.
Proceedings of the Public Key Cryptography, 2000

Analysis and Optimization of the TWINKLE Factoring Device.
Proceedings of the Advances in Cryptology, 2000


The XTR Public Key System.
Proceedings of the Advances in Cryptology, 2000

Key Improvements to XTR.
Proceedings of the Advances in Cryptology, 2000

1999
Chinese Remaindering Based Cryptosystems in the Presence of Faults.
J. Cryptology, 1999

Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999

Factorization of RSA-140 Using the Number Field Sieve.
Proceedings of the Advances in Cryptology, 1999

Efficient Identity Based Parameter Selection for Elliptic Curve Cryptosystems.
Proceedings of the Information Security and Privacy, 4th Australasian Conference, 1999

1998
Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998

Generating RSA Moduli with a Predetermined Portion.
Proceedings of the Advances in Cryptology, 1998

1997
Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems Over Finite Fields.
Proceedings of the Information Security and Privacy, Second Australasian Conference, 1997

1996
Securing the Net - The Fruits of Incompetence.
First Monday, 1996

Generating Standard DSA Signatures Without Long Inversion.
Proceedings of the Advances in Cryptology, 1996

A World Wide Number Field Sieve Factoring Record: On to 512 Bits.
Proceedings of the Advances in Cryptology, 1996

1995
A Key Escrow System with Warrant Bounds.
Proceedings of the Advances in Cryptology, 1995

NFS with Four Large Primes: An Explosive Experiment.
Proceedings of the Advances in Cryptology, 1995

Some Remarks on Lucas-Based Cryptosystems.
Proceedings of the Advances in Cryptology, 1995

1994
Factoring.
Proceedings of the Distributed Algorithms, 8th International Workshop, 1994

The Magic Words are Squeamish Ossifrage.
Proceedings of the Advances in Cryptology - ASIACRYPT '94, 4th International Conference on the Theory and Applications of Cryptology, Wollongong, Australia, November 28, 1994

Lattice sieving and trial division.
Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

1993
Uses of Randomness in Algorithms and Protocols (Joe Kilian).
SIAM Review, 1993

User Impersonation in Key Certification Schemes.
J. Cryptology, 1993

Factoring Integers Using SIMD Sieves.
Proceedings of the Advances in Cryptology, 1993

On the Factorization of RSA-120.
Proceedings of the Advances in Cryptology, 1993

1992
Massively Parallel Computing and Factoring.
Proceedings of the LATIN '92, 1992

Massively Parallel Elliptic Curve Factorin.
Proceedings of the Advances in Cryptology, 1992

The Eurocrypt '92 Controversial Issue: Trapdoor Primes and Moduli (Panel).
Proceedings of the Advances in Cryptology, 1992

1990
The Number Field Sieve
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Factoring With Two Large Primes.
Proceedings of the Advances in Cryptology, 1990

Algorithms in Number Theory.
Proceedings of the Handbook of Theoretical Computer Science, 1990

1989
Factoring by Electronic Mail.
Proceedings of the Advances in Cryptology, 1989

1987
Factoring Multivariate Polynomials over Algebraic Number Fields.
SIAM J. Comput., 1987

1985
Factoring Multivariate Polynomials over Finite Fields.
J. Comput. Syst. Sci., 1985

Factorization of Polynominals by Transcendental Evaluation.
Proceedings of the EUROCAL '85, 1985

1984
Factoring Multivariate Integral Polynomials.
Theor. Comput. Sci., 1984

Polynomial - time algorithms for the factorization of polynomials.
Bulletin of the EATCS, 1984

Factorization of polynomials.
ACM SIGSAM Bulletin, 1984

Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Factoring Multivariate Polynomials over Algebraic Number Fields.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

Polynomial Factorization by Root Approximation.
Proceedings of the EUROSAM 84, 1984

1983
Factoring Multivariate Polynomials over Finite Fields (Extended Abstract)
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Factoring Multivariate Integral Polynomials.
Proceedings of the Automata, 1983

Factoring polynominals over algebraic number fields.
Proceedings of the Computer Algebra, 1983

1982
Lattices and Factorization of Polynomials over Algebraic Number Fields.
Proceedings of the Computer Algebra, 1982

1981
Lattices and factorization of polynomials.
ACM SIGSAM Bulletin, 1981


  Loading...