Most cited papers in Cryptographic Implementations and Security
What are the most cited papers in Cryptographic Implementations and Security?
The most cited paper in Cryptographic Implementations and Security is "On the security of public key protocols" (Danny Dolev, A. C. Yao, 1983), with 5,851 citations. Next come "The Sybil Attack" (4,436) and "Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems" (4,361).
Showing 50 of 100 papers. Every paper with more than 785 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | On the security of public key protocols Danny Dolev, A. C. Yao · IEEE Transactions on Information Theory | Mar 1983 | 5,851 |
| 2 | The Sybil Attack John R. Douceur · Lecture notes in computer science | 2002 | 4,436 |
| 3 | Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems Paul C. Kocher · Lecture notes in computer science | 1996 | 4,361 |
| 4 | 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 |
| 5 | What's new in Psychtoolbox-3? Mario Kleiner, D Brainard, D Pelli · MPG.PuRe (Max Planck Society) | Aug 2007 | 3,760 |
| 6 | A key-management scheme for distributed sensor networks Laurent Eschenauer, Virgil D. Gligor | 18 Nov 2002 | 3,565 |
| 7 | Safeguarding cryptographic keys G. R. Blakley · 1979 International Workshop on Managing Requirements Knowledge (MARK) | Jun 1979 | 3,445 |
| 8 | Practical techniques for searches on encrypted data Dawn Xiaoding Song, David A. Wagner, Adrian Perrig | 7 Nov 2002 | 3,381 |
| 9 | Public Key Encryption with Keyword Search Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky et al. · Lecture notes in computer science | 2004 | 3,167 |
| 10 | Differential cryptanalysis of DES-like cryptosystems Eli Biham, Adi Shamir · Journal of Cryptology | 1991 | 2,911 |
| 11 | 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 |
| 12 | Linear Cryptanalysis Method for DES Cipher Mitsuru Matsui · Lecture notes in computer science | 1994 | 2,690 |
| 13 | Advances in Cryptology — CRYPTO’ 99 Michael Wiener · Lecture notes in computer science | 1999 | 2,622 |
| 14 | Probabilistic encryption Shafi Goldwasser, Silvio Micali · Journal of Computer and System Sciences | Apr 1984 | 2,586 |
| 15 | Security Arguments for Digital Signatures and Blind Signatures David Pointcheval, Jacques Stern · Journal of Cryptology | 21 Mar 2000 | 2,229 |
| 16 | A symmetric image encryption scheme based on 3D chaotic cat maps Guanrong Chen, Yaobin Mao, Charles K. Chui · Chaos Solitons & Fractals | 23 Jan 2004 | 2,105 |
| 17 | (Leveled) fully homomorphic encryption without bootstrapping Zvika Brakerski, Craig Gentry, Vinod Vaikuntanathan | 8 Jan 2012 | 1,791 |
| 18 | Examining smart-card security under the threat of power analysis attacks Thomas S. Messerges, Ezzy A. Dabbish, Robert H. Sloan · IEEE Transactions on Computers | May 2002 | 1,705 |
| 19 | Evaluating 2-DNF Formulas on Ciphertexts Dan Boneh, Eu-Jin Goh, Kobbi Nissim · Lecture notes in computer science | 2005 | 1,705 |
| 20 | Searchable symmetric encryption Reza Curtmola, Juan Alberto Peralta Garay, Seny Kamara et al. | 30 Oct 2006 | 1,671 |
| 21 | Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels Ran Canetti, Hugo Krawczyk · Lecture notes in computer science | 2001 | 1,667 |
| 22 | Keying Hash Functions for Message Authentication Mihir Bellare, Ran Canetti, Hugo Krawczyk · Lecture notes in computer science | 1996 | 1,600 |
| 23 | Power Analysis Attacks: Revealing the Secrets of Smart Cards Stefan Mangard, Elisabeth Oswald, Thomas Popp | 12 Mar 2007 | 1,585 |
| 24 | Divertible protocols and atomic proxy cryptography Matt Blaze, Gerrit Bleumer, Martin J. Strauss · Lecture notes in computer science | 1998 | 1,585 |
| 25 | Differential fault analysis of secret key cryptosystems Eli Biham, Adi Shamir · Lecture notes in computer science | 1997 | 1,573 |
| 26 | Multiparty unconditionally secure protocols David Chaum, Claude Crépeau, Ivan Damgård | 1988 | 1,552 |
| 27 | On the Importance of Checking Cryptographic Protocols for Faults Dan Boneh, Richard A. DeMillo, Richard J. Lipton · Lecture notes in computer science | 1997 | 1,475 |
| 28 | How to Break MD5 and Other Hash Functions Xiaoyun Wang, Hongbo Yu · Lecture notes in computer science | 2005 | 1,459 |
| 29 | Conjunctive, Subset, and Range Queries on Encrypted Data Dan Boneh, Brent R. Waters · Lecture notes in computer science | 16 May 2007 | 1,453 |
| 30 | A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack Ronald Cramer, Victor Shoup · Lecture notes in computer science | 1998 | 1,449 |
| 31 | New hash functions and their use in authentication and set equality Mark N. Wegman, J.Lawrence Carter · Journal of Computer and System Sciences | Jun 1981 | 1,448 |
| 32 | Finding Collisions in the Full SHA-1 Xiaoyun Wang, Yiqun Lisa Yin, Hongbo Yu · Lecture notes in computer science | 2005 | 1,431 |
| 33 | Security and Composition of Multiparty Cryptographic Protocols Ran Canetti · Journal of Cryptology | 2000 | 1,424 |
| 34 | Fast Software Encryption Mitsuru Matsui · Lecture notes in computer science | 2002 | 1,423 |
| 35 | The dining cryptographers problem: Unconditional sender and recipient untraceability David Chaum · Journal of Cryptology | 1988 | 1,418 |
| 36 | Security and Privacy Aspects of Low-Cost Radio Frequency Identification Systems Stephen A. Weis, Sanjay Emani Sarma, Ronald L. Rivest et al. · Lecture notes in computer science | 2004 | 1,390 |
| 37 | Cache Attacks and Countermeasures: The Case of AES Dag Arne Osvik, Adi Shamir, Eran Tromer · Lecture notes in computer science | 22 Dec 2005 | 1,371 |
| 38 | Polynomial Reconstruction Based Cryptography Aggelos Kiayias, Moti M. Yung · Lecture notes in computer science | 2001 | 1,360 |
| 39 | Encrypted key exchange: password-based protocols secure against dictionary attacks Steven M. Bellovin, Michael Merritt | 2 Jan 2003 | 1,359 |
| 40 | Pricing via Processing or Combatting Junk Mail Cynthia Dwork, Moni Naor · Lecture notes in computer science | 5 Aug 2007 | 1,296 |
| 41 | Template Attacks Suresh T. Chari, Josyula R. Rao, Pankaj Rohatgi · Lecture notes in computer science | 2003 | 1,286 |
| 42 | Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP Zvika Brakerski · Lecture notes in computer science | 2012 | 1,270 |
| 43 | Digital signcryption or how to achieve cost(signature & encryption) ≪ cost(signature) + cost(encryption) Yuliang Zheng · Lecture notes in computer science | 1997 | 1,262 |
| 44 | FPGA Intrinsic PUFs and Their Use for IP Protection Jorge Guajardo, Sandeep S. Kumar, Geert-Jan Schrijen et al. · Lecture notes in computer science | 22 Aug 2007 | 1,209 |
| 45 | A Design Principle for Hash Functions Ivan Damgård · Lecture notes in computer science | 8 Nov 2007 | 1,198 |
| 46 | Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits Sanjam Garg, Craig Gentry, Shai Halevi et al. | Oct 2013 | 1,149 |
| 47 | Threshold cryptosystems Yvo Desmedt, Yair Frankel · Lecture notes in computer science | 8 Nov 2007 | 1,131 |
| 48 | Secure Integration of Asymmetric and Symmetric Encryption Schemes Eiichiro Fujisaki, Tatsuaki Okamoto · Lecture notes in computer science | 1999 | 1,131 |
| 49 | Towards Sound Approaches to Counteract Power-Analysis Attacks Suresh T. Chari, Charanjit S. Jutla, Josyula R. Rao et al. · Lecture notes in computer science | 1999 | 1,124 |
| 50 | Self Protecting Pirates and Black-Box Traitor Tracing Aggelos Kiayias, Moti M. Yung · Lecture notes in computer science | 2001 | 1,123 |
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.