← Back

Cryptography Resources

• Alice and Bob
• Eve

Books

• Handbook of Applied Cryptography
• Lecture Notes on Cryptography
• A Computational Introduction to Number Theory and Algebra
• Codes, Ciphers and Codebreaking

Classic Ciphers

• Cipher
• Shift Cipher
• Substitution Cipher
• Affine Cipher
• Vigenère Cipher
• Hill Cipher
• Permutation Cipher

Classic Cryptanalysis

• Frequency Analysis
• Letter Frequencies
• Bigram, Trigram, N-gram
• Dot Product and Inner Product
• Kasiski Test
• Index of Coincidence

Perfect Secrecy and Information Theory

• Bayes' Theorem
• Perfect Secrecy
• Entropy
• Concavity
• Jensen's Inequality
• Kraft's Inequality
• Shannon's Source Coding Theorem
• Huffman Coding
• Unicity Distance
• A Mathematical Theory of Communication
• Communication Theory of Secrecy Systems
• Rényi Entropy
• Min Entropy
• Leftover Hash Lemma

Modern Ciphers

• Kerckhoffs' Principle
• Substitution-Permutation Network
• A Tutorial on Linear and Differential Cryptanalysis
• DES
• Standing the Test of Time: The Data Encryption Standard
• Triple-DES
• DES-X
• How to protect DES against exhaustive key search
• The Security of DESX
• Linear Cryptanalysis of DES
• Modes of Operations
• NIST Recommendation for Block Cipher Modes of Operation

Probability Theory

• Birthday Paradox

Elementary Number Theory

• Extended Euclidean Algorithm
• Bézout's Identity
• Chinese Remainder Theorem
• Coset
• Lagrange Theorem
• Euler's Phi Function
• Fermat's Little Theorem
• Euler's Theorem
• Modular Multiplicative Group of Integers
• Finite Field
• Quadratic Residue
• Jacobi Symbol
• Prime Number Theorem
• Solovay-Strassen Primality Test
• Integer Factorization
• Discrete Logarithm

Public Key Cryptosystems

• Public-Key Cryptography
• Merkle's Puzzles
• The RSA Problem
• RSA/Rabin least significant bits are 1/2+1/poly(log N) secure
• Rabin's Cryptosystem
• Key Exchange
• Diffie-Hellman Key Exchange

Random Oracle Model

• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Random oracles are practical: A paradigm for designing efficient protocols
• The Random Oracle Methodology, Revisited
• Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology

Hash Functions

• Hash Function
• Merkle–Damgård Construction
• Universal Hashing
• CBC-MAC

Pseudo-Random Generators

• Hardware Random Number Generator
• Pseudo-Random Generator
• /dev/random
• Analysis of the Linux Random Number Generator
• Yarrow
• Fortuna
• Attacks Against Weak PRGs

Source: KTH DD2448