World's Best Scientists 2026 revealed!
Award Badge
Computer Science
Switzerland
2025

D-Index & Metrics

Computer Science

D-Index
57
Citations
17887
World Ranking
3759
National Ranking
85

Research.com Recognitions

  • 2025 - Research.com Computer Science in Switzerland Leader Award
  • 2022 - Research.com Computer Science in Switzerland Leader Award

Overview

Arjen K. Lenstra is affiliated with the École Polytechnique Fédérale de Lausanne in Switzerland. Their research primarily spans the field of Computer Science, with a focus on specialized subfields such as Artificial Intelligence and Information Systems.

The central topics of their work include:

  • Coding theory and cryptography
  • Cryptography and Residue Arithmetic
  • Cryptographic Implementations and Security

Lenstra has published in the venue Mathematics of Computation, contributing at least one paper to this journal. The recent publication record includes the paper titled "Computation of a 30750-bit binary field discrete logarithm", published in 2021 within Mathematics of Computation.

Their frequent collaborators include:

  • Robert Granger
  • Thorsten Kleinjung
  • Benjamin Wesolowski
  • Jens Zumbrägel

The research focus on cryptographic subjects indicates an engagement with advanced security algorithms and computational complexity aspects of discrete logarithms and residue arithmetic. This aligns with the computer science subfields they work within, notably artificial intelligence applications that could intersect with cryptographic protocols and information systems management.

No book publications or awards have been recorded in the available data. The scientist is currently active in their research, continuing to contribute to academic literature and collaborative efforts within cryptography and computer science domains.

Best Publications

  • Factoring Polynomials with Rational Coefficients

    Arjen K. Lenstra;H. W. Lenstra;L. Lovasz

  • Selecting Cryptographic Key Sizes

    Arjen K. Lenstra;Eric R. Verheul

  • The XTR public key system

    A. K. Lenstra;E. R. Verheul

  • Factorization of a 768-bit RSA modulus.

    Thorsten Kleinjung;Kazumaro Aoki;Jens Franke;Arjen K. Lenstra

  • The Development of the Number Field Sieve

    Arjen K. Lenstra;Hendrik W. Lenstra

  • The number field sieve

    A. K. Lenstra;H. W. Lenstra;M. S. Manasse;J. M. Pollard

  • Algorithms in number theory

    A. K. Lenstra;H. W. Lenstra

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

    Marc Stevens;Alexander Sotirov;Jacob Appelbaum;Arjen K. Lenstra

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

    Marc Stevens;Arjen Lenstra;Benne Weger

  • Factorization of a 512-bit RSA modulus

    Stefania Cavallar;Bruce Dodson;Arjen K. Lenstra;Walter Lioen

  • Chinese Remaindering Based Cryptosystems in the Presence of Faults

    Marc Joye;Arjen K. Lenstra;Jean-Jacques Quisquater

  • The Magic Words are Squeamish Ossifrage

    Derek Atkins;Michael Graff;Arjen K. Lenstra;Paul C. Leyland

  • Factoring multivariate polynomials over finite fields

    Arjen K. Lenstra

  • The factorization of the ninth Fermat number

    A. K. Lenstra;H. W. Lenstra;M. S. Manasse;J. M. Pollard

  • MD5 considered harmful today, creating a rogue CA certificate

    A. Sotirov;M. Stevens;J. Appelbaum;Arjen K. Lenstra

  • Ron was wrong, Whit is right

    Arjen Lenstra;James P. Hughes;Maxime Augier;Joppe Willem Bos

  • Integer Factoring

    Arjen K. Lenstra

  • Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers

    R. Kannan;Arjen K. Lenstra;L. Lovasz

  • Unbelievable Security. Matching AES Security Using Public Key Systems

    Arjen K. Lenstra

  • Factorization of RSA-140 Using the Number Field Sieve

    Stefania Cavallar;Bruce Dodson;Arjen K. Lenstra;Paul C. Leyland

  • Factorization of RSA-140 using the Number Field sieve

    S. Cavallar;B. Dodson;A. Lenstra;P. Leyland

Frequent Co-Authors

Mark S. Manasse
Mark S. Manasse Microsoft (United States)
David Molnar
David Molnar Microsoft (United States)
Adi Shamir
Adi Shamir Weizmann Institute of Science
Eran Tromer
Eran Tromer Tel Aviv University
Peter Winkler
Peter Winkler Dartmouth College
Pierrick Gaudry
Pierrick Gaudry University of Lorraine
Ron Steinfeld
Ron Steinfeld Monash University
Robert E. Bixby
Robert E. Bixby Rice University
Christof Paar
Christof Paar Max Planck Institute for Security and Privacy

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

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Advancing your education in Computer Science has never been more accessible, thanks to a growing number of online degree options. If you need to fast-track your learning, many shortest masters degree programs online offer intensive, accelerated curricula. This helps working professionals gain advanced skills and credentials in less time.

Choosing the right program is essential. Exploring the best masters degree to get can help you identify degrees that are in high demand by employers and offer the greatest return on your investment.

For those just beginning their higher education journey, a flexible online associate degree in Computer Science can provide foundational knowledge and open doors to entry-level positions or further study.

Cost can be a concern, but there are a range of cheap online college classes that make it possible to upgrade your qualifications without breaking the bank. These affordable options ensure that career advancement is within reach for more students.

Best Scientists Citing Arjen K. Lenstra

Trending Scientists

Recently Published Articles