Most cited papers in Cryptography and Residue Arithmetic
What are the most cited papers in Cryptography and Residue Arithmetic?
The most cited paper in Cryptography and Residue Arithmetic is "How to share a secret" (Adi Shamir, 1979), with 13,673 citations. Next come "A public key cryptosystem and a signature scheme based on discrete logarithms" (8,095) and "Identity-Based Encryption from the Weil Pairing" (7,095).
Showing 50 of 97 papers. Every paper with more than 438 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | How to share a secret Adi Shamir · Communications of the ACM | Nov 1979 | 13,673 |
| 2 | A public key cryptosystem and a signature scheme based on discrete logarithms Taher ElGamal · IEEE Transactions on Information Theory | Jul 1985 | 8,095 |
| 3 | Identity-Based Encryption from the Weil Pairing Dan Boneh, Matthew K. Franklin · Lecture notes in computer science | 2001 | 7,095 |
| 4 | Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems Paul C. Kocher · Lecture notes in computer science | 1996 | 4,361 |
| 5 | Use of Elliptic Curves in Cryptography Victor S. Miller · Lecture notes in computer science | 28 Feb 2007 | 3,968 |
| 6 | How To Prove Yourself: Practical Solutions to Identification and Signature Problems Amos Fiat, Adi Shamir · Lecture notes in computer science | 5 Apr 2007 | 3,943 |
| 7 | Short Signatures from the Weil Pairing Dan Boneh, Ben Lynn, Hovav Shacham · Lecture notes in computer science | 2001 | 3,006 |
| 8 | Homomorphic Encryption for Arithmetic of Approximate Numbers Jung Hee Cheon, Andrey Kim, Miran Kim et al. · Lecture notes in computer science | 2017 | 2,376 |
| 9 | The Elliptic Curve Digital Signature Algorithm (ECDSA) Don B. Johnson, Alfred Menezes, Scott A. Vanstone · International Journal of Information Security | Aug 2001 | 2,252 |
| 10 | Certificateless Public Key Cryptography Sattam S. Al-Riyami, Kenneth G. Paterson · Lecture notes in computer science | 2003 | 2,226 |
| 11 | Short Group Signatures Dan Boneh, Xavier Boyen, Hovav Shacham · Lecture notes in computer science | 2004 | 2,109 |
| 12 | Efficient Identity-Based Encryption Without Random Oracles Brent R. Waters · Lecture notes in computer science | 2005 | 2,036 |
| 13 | Aggregate and Verifiably Encrypted Signatures from Bilinear Maps Dan Boneh, Craig Gentry, Ben Lynn et al. · Lecture notes in computer science | 2003 | 1,827 |
| 14 | Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles Dan Boneh, Xavier Boyen · Lecture notes in computer science | 2004 | 1,784 |
| 15 | A Certified Digital Signature Ralph C. Merkle · Lecture notes in computer science | 8 Nov 2007 | 1,708 |
| 16 | Short Signatures Without Random Oracles Dan Boneh, Xavier Boyen · Lecture notes in computer science | 2004 | 1,464 |
| 17 | (Leveled) Fully Homomorphic Encryption without Bootstrapping Zvika Brakerski, Craig Gentry, Vinod Vaikuntanathan · ACM Transactions on Computation Theory | Jul 2014 | 1,456 |
| 18 | Multiparty Computation from Somewhat Homomorphic Encryption Ivan Damgård, Valerio Pastro, Nigel Paul Smart et al. · Lecture notes in computer science | 2012 | 1,334 |
| 19 | Lower Bounds for Discrete Logarithms and Related Problems Victor Shoup · Lecture notes in computer science | 1997 | 1,231 |
| 20 | An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.) S.C. Pohlig, Martin E. Hellman · IEEE Transactions on Information Theory | 1978 | 1,193 |
| 21 | A new efficient algorithm for computing Gröbner bases (F4) Jean‐Charles Faugère · Journal of Pure and Applied Algebra | Jun 1999 | 1,143 |
| 22 | An Identity Based Encryption Scheme Based on Quadratic Residues Clifford Cocks · Lecture notes in computer science | 2001 | 1,110 |
| 23 | Hierarchical ID-Based Cryptography Craig Gentry, Alice Silverberg · Lecture notes in computer science | 2002 | 1,107 |
| 24 | Public-key cryptosystems provably secure against chosen ciphertext attacks Moni Naor, Moti M. Yung | 1990 | 1,100 |
| 25 | CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM Joppe W. Bos, Léo Ducas, Eike Kiltz et al. | Apr 2018 | 1,096 |
| 26 | Efficient Algorithms for Pairing-Based Cryptosystems Paulo S. L. M. Barreto, Hae Yong Kim, Ben Lynn et al. · Lecture notes in computer science | 2002 | 1,077 |
| 27 | Cryptographic Cloud Storage Seny Kamara, Kristin Lauter · Lecture notes in computer science | 2010 | 1,075 |
| 28 | Reducing elliptic curve logarithms to logarithms in a finite field Alfred Menezes, Takuya Okamoto, Scott A. Vanstone · IEEE Transactions on Information Theory | 1993 | 1,033 |
| 29 | Improved decoding of Reed-Solomon and algebraic-geometry codes Venkatesan Guruswami, Madhu Sudan · IEEE Transactions on Information Theory | 1999 | 1,021 |
| 30 | Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme Alexandra Boldyreva · Lecture notes in computer science | 18 Dec 2002 | 1,005 |
| 31 | Efficient Lattice (H)IBE in the Standard Model Shweta Agrawal, Dan Boneh, Xavier Boyen · Lecture notes in computer science | 2010 | 983 |
| 32 | Cuba—a library for multidimensional numerical integration Thomas H. Hahn · Computer Physics Communications | 19 Apr 2005 | 981 |
| 33 | Resistance Against Differential Power Analysis For Elliptic Curve Cryptosystems Jean-Sébastien Coron · Lecture notes in computer science | 1999 | 965 |
| 34 | The Exact Security of Digital Signatures-How to Sign with RSA and Rabin Mihir Bellare, Phillip Rogaway · Lecture notes in computer science | 1996 | 951 |
| 35 | Vector Bundles Over an Elliptic Curve Michael Francis Atiyah · Proceedings of the London Mathematical Society | 1957 | 948 |
| 36 | An Identity-Based Signature from Gap Diffie-Hellman Groups Jae Choon Cha, Jung Hee Cheon · Lecture notes in computer science | 18 Dec 2002 | 925 |
| 37 | Non-interactive zero-knowledge and its applications Manuel Blum, Paul Feldman, Silvio Micali | 1988 | 890 |
| 38 | Pairing-Friendly Elliptic Curves of Prime Order Paulo S. L. M. Barreto, Michael Naehrig · Lecture notes in computer science | 2006 | 885 |
| 39 | Practical Threshold Signatures Victor Shoup · Lecture notes in computer science | 2000 | 879 |
| 40 | Efficient Identity Based Signature Schemes Based on Pairings Florian Heß · Lecture notes in computer science | 2003 | 848 |
| 41 | Public-key cryptosystems from the worst-case shortest vector problem Chris Peikert | 31 May 2009 | 817 |
| 42 | Pairings for cryptographers Steven D. Galbraith⋆, Kenneth G. Paterson, Nigel Paul Smart · Discrete Applied Mathematics | 6 Mar 2008 | 801 |
| 43 | Selecting Cryptographic Key Sizes Arjen K. Lenstra, Eric R. Verheul · Journal of Cryptology | 14 Aug 2001 | 789 |
| 44 | A new efficient algorithm for computing Gröbner bases without reduction to zero ( F 5 ) Jean Charles Faugère | 10 Jul 2002 | 781 |
| 45 | Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities Don Coppersmith · Journal of Cryptology | Sep 1997 | 775 |
| 46 | THE ADVANCED ENCRYPTION STANDARD William Stallings · Cryptologia | Jul 2002 | 775 |
| 47 | A public-key infrastructure for key distribution in TinyOS based on elliptic curve cryptography David J. Malan, Matt Welsh, Matthew Smith | 6 Apr 2005 | 713 |
| 48 | How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits Craig Gidney, Martin Ekerå · Quantum | 15 Apr 2021 | 709 |
| 49 | jPBC: Java pairing based cryptography Angelo De, Vincenzo Iovino | Jun 2011 | 708 |
| 50 | CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme Léo Ducas, Eike Kiltz, Tancrède Lepoint et al. · IACR Transactions on Cryptographic Hardware and Embedded Systems | 14 Feb 2018 | 693 |
Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for a field when OpenAlex files it under one of the field's topics; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.