Your first time on this page? Allow me to give some explanations.
A curated list of cryptography papers, articles, tutorials and howtos.
Here you can see meta information about this topic like the time we last updated this page, the original creator of the awesome list and a link to the original GitHub repository.
Thank you pFarb & contributors
View Topic on GitHub:
Search for resources by name or description.
Simply type in what you are looking for and the results will be filtered on the fly.
Further filter the resources on this page by type (repository/other resource), number of stars on GitHub and time of last commit in months.
Simple: cryptography for non-engineers
By Needham, Schroeder: this is were crypto-based auth starts.
General cryptographic interest
Inquiries into formalism and naive intuition behind security proofs, by Neal Koblitz et al.
Introductory paper on NaCl, discussing important aspects of implementing cryptography and using it as a larger building block in security systems, by Daniel J. Bernstein, Tanja Lange, Peter Schwabe.
The Keyed-Hash Message Authentication Code FIPS document.
SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions.
The best simple explanation of math behind birthday attack.
Security analysis of different legacy HMAC schemes by Jongsung Kim et al.
Security of randomized CBC-MACs and a new construction that resists birthday paradox attacks and provably reaches full security, by E. Jaulmes et al.
Secret key cryptography
Maintained by NIST.
If stuff above was a bit hard or you're looking for a good laugh.
Example of designing great practical attack on cipher implementation, by Daniel J. Bernstein.
Side channel attacks on AES, another view, by Dag Arne Osvik, Adi Shamir and Eran Tromer.
Broad explanation of Salsa20 security cipher by Daniel J. Bernstein.
Analysis of Salsa20 family of ciphers, by Jean-Philippe Aumasson et al.
IETF Draft of ciphersuite family, by Adam Langley et al.
Original Rijndael proposal by Joan Daemen and Vincent Rijmen.
Overview of ongoing research in secret key crypto and hashes by ECRYPT Network of Excellence in Cryptology.
Original paper introducing GCM, by by David A. McGrew and John Viega.
Design, analysis and security of GCM, and, more specifically, AES GCM mode, by David A. McGrew and John Viega.
An analysis and algorithm for nonce generation for AES GCM with higher counter-collision probability, by Yuichi Niwa, Keisuke Ohashi, Kazuhiko Minematsu, Tetsu Iwata.
An overview of existing searchable encryption schemes, and analysis of scheme built on AES-GCM, blind index and bloom filter by Eugene Pilyankevich, Dmytro Kornieiev, Artem Storozhuk.
A great example of stream cipher cryptoanalysis, by Yukiyasu Tsunoo et al.
Applying slide attacks (typical cryptoanalysis technique for block ciphers) to hash functions, M. Gorski et al.
Attempt to organize the existing literature of block-cipher cryptanalysis in a way that students can use to learn cryptanalytic techniques and ways to break new algorithms, by Bruce Schneier.
By Elad Pinhas Barkan.
Analysis of number of rounds for symmetric cryptography primitives, and suggestions to do fewer rounds, by Jean-Philippe Aumasson.
A 2005 paper about modular differential collision attack on MD5, MD4 and other hash functions, by Xiaoyun Wang and Hongbo Yu.
A 2012 paper about using the combination of differential and algebraic techniques for collision attacks on SHA-3, by Itai Dinur, Orr Dunkelman, Adi Shamir.
Public key cryptography: General and DLP
Seminal paper by Diffie and Hellman, introducing public key cryptography and key exchange/agreement protocol.
An explanation of the Diffie-Hellman methon in more engineering terms.
Original paper introducing RSA algorithm.
Rather education explanation of every bit behind RSA.
Paper by R. Merkle, predated "New directions in cryptography" though it was published after it. The Diffie-Hellman key exchange is an implementation of such a Merkle system.
Dolev-Yao model is a formal model, used to prove properties of interactive cryptographic protocols.
A safe method for sharing secrets.
Great inquiry into attacking RSA and it's internals, by Dan Boneh.
An example in attacking practical crypto implementationby D. Boneh, D. Brumley.
Public key cryptography: Elliptic-curve crypto
EdDSA explained with ease and elegance.
Historic inquiry into development of ECC and it's adoption.
Fine example of building up ECC from scratch.
For many elliptic curve representation forms.
Paper on Curve25519.
Pracitcal example of implementing elliptic curve crypto, by M. Brown et al.
Zero Knowledge Proofs
A pair of papers which investigate the notions of proof of knowledge and proof of computational ability, M. Bellare and O. Goldreich.
Classic paper by Goldreich, Micali and Wigderson.
By Goldreich, Micali and Wigderson, a relative to the above.
By Manuel Blum.
Brassau et al.
By GoldWasser, Micali and Rackoff. Defining computational complexity of "knowledge" within zero knowledge proofs.
Great intro on original ZKP protocols.
A good intro into Zero knowledge protocols.
Methodologically very relevant document on goals and procedures of key management.
Brief observation of mathematical tasks that can be used to build cryptosystems secure against attacks by post-quantum computers.
Introduction to post-quantum cryptography.
The book covers many constructions for different tasks in cryptography.
Broad overview of design and cryptoanalysis of various ciphers and hash functions, by Bart Van Rompay.
Predominantly mathematically oriented information on learning, using and experimenting cryptographic procedures.
By Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone. Good classical introduction into cryptography and ciphers.
By Mike Rosulek. A lot of basic stuff covered really well. No ECC.
By Victor Shoup, excellent starters book on math universally used in cryptography.
Lectures and educational courses
Often overlooked, this book is a boon for beginners to the field. It contains plenty of exercises at the end of each chapter, aimed at reinforcing concepts and cementing ideas.
Lecture notes by Rafael Pass, Abhi Shelat.
Famous set of lectures on cryptography by Shafi Goldwasser (MIT), M. Bellare (University of California).
Video course by Christof Paar (University of Bochum in Germany). In english.
The course begins with a detailed discussion of how two parties who have a shared secret key can communicate securely when a powerful adversary eavesdrops and tampers with traffic. We will examine many deployed protocols and analyze mistakes in existing systems.
Online crypto challenges
A platform with lots of interactive cryptography challenges, similar to Cryptopals.