Topic · Coding theory and cryptography
Most cited papers in Coding theory and cryptography
What are the most cited papers in Coding theory and cryptography?
The most cited paper in Coding theory and cryptography is "Least squares quantization in PCM" (Sheelagh Lloyd, 1982), with 16,039 citations. Next come "New directions in cryptography" (14,610) and "Algorithms for quantum computation: discrete logarithms and factoring" (8,790).
Showing 50 of 98 papers. Every paper with more than 849 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | Least squares quantization in PCM Sheelagh Lloyd · IEEE Transactions on Information Theory | Mar 1982 | 16,039 |
| 2 | New directions in cryptography Whitfield Diffie, Martin E. Hellman · IEEE Transactions on Information Theory | Nov 1976 | 14,610 |
| 3 | Algorithms for quantum computation: discrete logarithms and factoring Peter W. Shor | 17 Dec 2002 | 8,790 |
| 4 | A public key cryptosystem and a signature scheme based on discrete logarithms Taher ElGamal · IEEE Transactions on Information Theory | Jul 1985 | 8,095 |
| 5 | Public-Key Cryptosystems Based on Composite Degree Residuosity Classes Pascal Paillier · Lecture notes in computer science | 10 Oct 2007 | 7,322 |
| 6 | Fully homomorphic encryption using ideal lattices Craig Gentry | 31 May 2009 | 6,742 |
| 7 | Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 Claude Berrou, Alain Glavieux, Punya Thitimajshima | 30 Dec 2002 | 6,739 |
| 8 | A Method for the Construction of Minimum-Redundancy Codes David A. Huffman · Proceedings of the IRE | Sep 1952 | 6,391 |
| 9 | Mersenne twister Makoto Matsumoto, Takuji Nishimura · ACM Transactions on Modeling and Computer Simulation | 1998 | 5,805 |
| 10 | Factoring polynomials with rational coefficients A. K. Lenstra, Hendrik W. Lenstra, László Lovász · Mathematische Annalen | Dec 1982 | 4,058 |
| 11 | Use of Elliptic Curves in Cryptography Victor S. Miller · Lecture notes in computer science | 28 Feb 2007 | 3,968 |
| 12 | A recursive approach to low complexity codes R. Michael Tanner · IEEE Transactions on Information Theory | Sep 1981 | 3,178 |
| 13 | Short Signatures from the Weil Pairing Dan Boneh, Ben Lynn, Hovav Shacham · Lecture notes in computer science | 2001 | 3,006 |
| 14 | Differential cryptanalysis of DES-like cryptosystems Eli Biham, Adi Shamir · Journal of Cryptology | 1991 | 2,911 |
| 15 | Near optimum error correcting coding and decoding: turbo-codes Claude Berrou, Alain Glavieux · IEEE Transactions on Communications | 1996 | 2,771 |
| 16 | PRESENT: An Ultra-Lightweight Block Cipher Andrey Bogdanov, Lars Ramkilde Knudsen, Gregor Leander et al. · Lecture notes in computer science | 22 Aug 2007 | 2,757 |
| 17 | Linear Cryptanalysis Method for DES Cipher Mitsuru Matsui · Lecture notes in computer science | 1994 | 2,690 |
| 18 | Advances in Cryptology — CRYPTO’ 99 Michael Wiener · Lecture notes in computer science | 1999 | 2,622 |
| 19 | A fully homomorphic encryption scheme Dan Boneh, Craig Gentry | 2009 | 2,388 |
| 20 | Iterative decoding of binary block and convolutional codes Joachim Hagenauer, Elke Offer, L. Papke · IEEE Transactions on Information Theory | Mar 1996 | 2,320 |
| 21 | On lattices, learning with errors, random linear codes, and cryptography Oded Regev | 22 May 2005 | 2,312 |
| 22 | Shift-register synthesis and BCH decoding J. Massey · IEEE Transactions on Information Theory | 1969 | 2,209 |
| 23 | Iterative (turbo) soft interference cancellation and decoding for coded CDMA Xiaodong Wang, H. Vincent Poor · IEEE Transactions on Communications | Jul 1999 | 1,946 |
| 24 | Fully Homomorphic Encryption over the Integers Marten van Dijk, Craig Gentry, Shai Halevi et al. · Lecture notes in computer science | 2010 | 1,884 |
| 25 | List Decoding of Polar Codes Ido Tal, Alexander Vardy · IEEE Transactions on Information Theory | 5 Mar 2015 | 1,867 |
| 26 | Quantum error correction via codes over GF(4) A.R. Calderbank, Eric M. Rains, Peter Shor et al. · IEEE Transactions on Information Theory | Jul 1998 | 1,833 |
| 27 | Polyphase codes with good periodic correlation properties (Corresp.) Delin Chu · IEEE Transactions on Information Theory | Jul 1972 | 1,739 |
| 28 | Evaluating 2-DNF Formulas on Ciphertexts Dan Boneh, Eu-Jin Goh, Kobbi Nissim · Lecture notes in computer science | 2005 | 1,705 |
| 29 | Channel estimation techniques based on pilot arrangement in OFDM systems Sinem Çöleri, Mustafa Ergen, Anuj Puri et al. · IEEE Transactions on Broadcasting | Sep 2002 | 1,610 |
| 30 | Crosscorrelation properties of pseudorandom and related sequences D.V. Sarwate, M.B. Pursley · Proceedings of the IEEE | 1980 | 1,610 |
| 31 | Differential fault analysis of secret key cryptosystems Eli Biham, Adi Shamir · Lecture notes in computer science | 1997 | 1,573 |
| 32 | A universal lattice code decoder for fading channels Emanuele Viterbo, J. Bouros · IEEE Transactions on Information Theory | Jul 1999 | 1,569 |
| 33 | Three-terminal communication channels Edward C. van der Meulen · Advances in Applied Probability | 1971 | 1,534 |
| 34 | The zero error capacity of a noisy channel Claude E. Shannon · IEEE Transactions on Information Theory | Sep 1956 | 1,531 |
| 35 | On the inherent intractability of certain coding problems (Corresp.) Elwyn R. Berlekamp, Robert J. McEliece, Henk van Tilborg · IEEE Transactions on Information Theory | May 1978 | 1,527 |
| 36 | Efficient Fully Homomorphic Encryption from (Standard) LWE Zvika Brakerski, Vinod Vaikuntanathan | Oct 2011 | 1,481 |
| 37 | SIMPLE GROUPS OF LIE TYPE Ian G. MacDonald · Bulletin of the London Mathematical Society | Mar 1975 | 1,471 |
| 38 | How to Break MD5 and Other Hash Functions Xiaoyun Wang, Hongbo Yu · Lecture notes in computer science | 2005 | 1,459 |
| 39 | Closest point search in lattices Erik Agrell, Thomas Eriksson, Alexander Vardy et al. · IEEE Transactions on Information Theory | Aug 2002 | 1,450 |
| 40 | Finding Collisions in the Full SHA-1 Xiaoyun Wang, Yiqun Lisa Yin, Hongbo Yu · Lecture notes in computer science | 2005 | 1,431 |
| 41 | The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes A. Roger Hammons, P. Vijay Kumar, A.R. Calderbank et al. · IEEE Transactions on Information Theory | Mar 1994 | 1,430 |
| 42 | Efficient Identification and Signatures for Smart Cards Claus Peter Schnorr · Lecture notes in computer science | 8 Nov 2007 | 1,371 |
| 43 | Code division multiple-access techniques in optical fiber networks. I. Fundamental principles Jawad A. Salehi · IEEE Transactions on Communications | 1989 | 1,369 |
| 44 | Polynomial Reconstruction Based Cryptography Aggelos Kiayias, Moti M. Yung · Lecture notes in computer science | 2001 | 1,360 |
| 45 | Hierarchical Identity Based Encryption with Constant Size Ciphertext Dan Boneh, Xavier Boyen, Eu-Jin Goh · Lecture notes in computer science | 2005 | 1,351 |
| 46 | A Survey on Homomorphic Encryption Schemes Abbas Acar, Hidayet Aksu, Arif Selcuk Uluagac et al. · ACM Computing Surveys | 25 Jul 2018 | 1,348 |
| 47 | On “bent” functions Oscar S. Rothaus · Journal of Combinatorial Theory Series A | May 1976 | 1,344 |
| 48 | Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption Allison Bishop Lewko, Tatsuaki Okamoto, Amit Sahai et al. · Lecture notes in computer science | 2010 | 1,320 |
| 49 | Iterative correction of intersymbol interference: Turbo‐equalization Catherine Douillard, Michel Jézéquel, Claude Berrou et al. · European Transactions on Telecommunications | Sep 1995 | 1,317 |
| 50 | Lower bounds on the maximum cross correlation of signals (Corresp.) Lloyd R. Welch · IEEE Transactions on Information Theory | May 1974 | 1,307 |
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.