Arjen K. Lenstra
- Artificial Intelligence top 1%
- Information Systems top 1%
- Computational Theory and Mathematics top 2%
- Computer Networks and Communications top 5%
- Computer Vision and Pattern Recognition top 5%
- Co-authors
- Eric R. VerheulH. W. LenstraMark S. ManasseJ. M. PollardKaren AardalJean-Jacques QuisquaterMarc JóyeC.A.J. Hurkens
- Topics
- Coding theory and cryptography (31 papers)Cryptography and Residue Arithmetic (27 papers)Polynomial and algebraic computation (12 papers)
- Partner nations
- United StatesNetherlandsSwitzerland
In The Last Decade
Arjen K. Lenstra
51 papers receiving 1.2k citations
Peers
Comparison fields: 5 of 63
- Artificial Intelligence 1.0k
- Information Systems 560
- Computational Theory and Mathematics 329
- Computer Networks and Communications 293
- Computer Vision and Pattern Recognition 283
Countries citing papers authored by Arjen K. Lenstra
This map shows the geographic impact of Arjen K. Lenstra's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Arjen K. Lenstra with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Arjen K. Lenstra more than expected).
Fields of papers citing papers by Arjen K. Lenstra
This network shows the impact of papers produced by Arjen K. Lenstra. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Arjen K. Lenstra. The network helps show where Arjen K. Lenstra may publish in the future.
Co-authorship network of co-authors of Arjen K. Lenstra
This figure shows the co-authorship network connecting the top 25 collaborators of Arjen K. Lenstra. A scholar is included among the top collaborators of Arjen K. Lenstra based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Arjen K. Lenstra. Arjen K. Lenstra is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 2 | |
| 2 | Security observance throughout the life-cycle of embedded systems | 12 |
| 3 | Further progress in hashing cryptanalysis | 6 |
| 4 | 38 | |
| 5 | Factorization of a 512-bit RSA modulus | 24 |
| 6 | Selecting Cryptographic Key Sizes. | 0 |
| 7 | 1 | |
| 8 | 44 | |
| 9 | 70 | |
| 10 | 6 | |
| 11 | Factoring with two large primes (extended abstract) | 3 |
| 12 | 8 | |
| 13 | 75 | |
| 14 | Polynomial-time algorithms for the factorization of polynomials | 4 |
| 15 | 28 | |
| 16 | Factoring multivariate polynomials over algebraic number fields | 2 |
| 17 | Polynomial factorization by root approximation | 1 |
| 18 | Factoring polynomials with integer coefficients | 12 |
| 19 | Factoring polynomials with rational coeficients | 8 |
| 20 | 6 |
About Arjen K. Lenstra
Arjen K. Lenstra is a scholar working on Theoretical Computer Science, Algebra and Number Theory and Information Systems, having authored 55 papers that have together received 1.4k indexed citations. Recurring topics across this work include Coding theory and cryptography (31 papers), Cryptography and Residue Arithmetic (27 papers) and Polynomial and algebraic computation (12 papers). The work is most often cited by research in Artificial Intelligence (1.0k citations), Information Systems (560 citations) and Computational Theory and Mathematics (329 citations). Arjen K. Lenstra has collaborated with scholars based in United States, Netherlands and Switzerland. Frequent co-authors include Eric R. Verheul, H. W. Lenstra, Mark S. Manasse, J. M. Pollard, Karen Aardal, Jean-Jacques Quisquater, Marc Jóye, C.A.J. Hurkens, Henri Cohen and Marc Stevens. Their work appears in journals such as IEEE Transactions on Information Theory, Mathematics of Computation and SIAM Journal on Computing.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.