Arjen K. Lenstra

École Polytechnique Fédérale de Lausanne
Switzerland

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name Citations Publications World Ranking National Ranking

Computer Science D-index 53 Citations 16,639 123 World Ranking 3120 National Ranking 77

Overview

What are the main themes of his work throughout his whole career to date

Arjen K. Lenstra incorporates Applied mathematics and Discrete mathematics in his research. His study deals with a combination of Discrete mathematics and Applied mathematics. His Combinatorics study frequently intersects with other fields, such as Sieve (category theory). He frequently studies issues relating to Combinatorics and Sieve (category theory). In his study, Arjen K. Lenstra carries out multidisciplinary Algorithm and Upper and lower bounds research. Arjen K. Lenstra connects Upper and lower bounds with Algorithm in his study. His research links Mathematical analysis with Linear equation. His Mathematical analysis study frequently links to adjacent areas such as Linear equation. His research ties Geometry and Reduction (mathematics) together.

Arjen K. Lenstra most often published in these fields:

Applied mathematics (66.67%)
Combinatorics (33.33%)
Sieve (category theory) (33.33%)

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Factoring Polynomials with Rational Coefficients

Arjen K. Lenstra;H. W. Lenstra;L. Lovasz.
Mathematische Annalen (1982)

5605 Citations

Selecting Cryptographic Key Sizes

Arjen K. Lenstra;Eric R. Verheul.
Journal of Cryptology (2001)

1833 Citations

The XTR public key system

A. K. Lenstra;E. R. Verheul.
Lecture Notes in Computer Science (2000)

778 Citations

Factorization of a 768-bit RSA modulus.

Thorsten Kleinjung;Kazumaro Aoki;Jens Franke;Arjen K. Lenstra.
IACR Cryptology ePrint Archive (2010)

633 Citations

The Development of the Number Field Sieve

Arjen K. Lenstra;Hendrik W. Lenstra.
(1993)

612 Citations

Factorization of a 768-bit RSA modulus

Thorsten Kleinjung;Kazumaro Aoki;Jens Franke;Arjen K. Lenstra.
international cryptology conference (2010)

601 Citations

The number field sieve

A. K. Lenstra;H. W. Lenstra;M. S. Manasse;J. M. Pollard.
symposium on the theory of computing (1990)

382 Citations

Algorithms in number theory

A. K. Lenstra;H. W. Lenstra.
Handbook of theoretical computer science (vol. A) (1991)

381 Citations

Short chosen-prefix collisions for MD5 and the creation of a rogue CA certificate

Marc Stevens;Alexander Sotirov;Jacob Appelbaum;Arjen K. Lenstra.
IACR Cryptology ePrint Archive (2009)

279 Citations

Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities

Marc Stevens;Arjen Lenstra;Benne Weger.
international cryptology conference (2007)

267 Citations

If you think any of the details on this page are incorrect, let us know.

Arjen K. Lenstra

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Overview

What are the main themes of his work throughout his whole career to date

Arjen K. Lenstra most often published in these fields:

Best Publications

Report an issue

Frequent Co-Authors

External Links

Best Scientists Citing Arjen K. Lenstra

Trending Scientists