The Joy of Cryptography
Undergraduate textbook by Mike Rosulek

The Joy of Cryptography is a textbook that I've been writing for CS427, my undergraduate course in cryptography. It's free and will always be free (Creative Commons license), with vital support from the NSF and the Oregon State University open textbook initiative.

Yes, I know that the title is ridiculous. All of the serious titles were already taken, and I wanted something more upbeat than You Can't Spell Cryptography Without Cry. I hope you understand that actual joy is not guaranteed.


Download the current draft (PDF, Jan 3, 2021)

Current table of contents (links are for PDFs of individual chapters):

  1. Preface
  2. Review of Concepts & Notation
  3. One-Time Pad
    • What Is [Not] Cryptography?
    • Specifics of One-Time Pad
  4. The Basics of Provable Security
    • How to Write a Security Definition
    • Formalisms for Security Definitions
    • How to Demonstrate Insecurity with Attacks
    • How to Prove Security with the Hybrid Technique
    • How to Compare/Contrast Security Definitions
  5. Secret Sharing
    • Definitions
    • A Simple 2-out-of-2 Scheme
    • Polynomial Interpolation
    • Shamir Secret Sharing
    • Visual Secret Sharing
  6. Basing Cryptography on Intractable Computations
    • What Qualifies as a "Computationally Infeasible" Attack?
    • What Qualifies as a "Negligible" Success Probability?
    • Indistinguishability
    • Birthday Probabilities & Sampling With/out Replacement
  7. Pseudorandom Generators
    • Definition
    • Pseudorandom Generators in Practice
    • Application: Shorter Keys in One-Time Secret Encryption
    • Contrapositive Point of View on Security Proofs
    • Extending the Stretch of a PRG
    • Applications: Stream Cipher & Symmetric Ratchet
  8. Pseudorandom Functions & Block Ciphers
    • Definition
    • PRFs vs PRGs; Variable-Hybrid Proofs
    • Block Ciphers (Pseudorandom Permutations)
    • Relating PRFs and Block Ciphers
    • PRFs and Block Ciphers in Practice
    • Strong Pseudorandom Permutations
  9. Security against Chosen Plaintext Attacks
    • Limits of Deterministic Encryption
    • Pseudorandom Ciphertexts
    • CPA-Secure Encryption Based on PRFs
  10. Block Cipher Modes of Operation
    • A Tour of Common Modes
    • CPA Security for Variable-Length Plaintexts
    • Security of OFB Mode
    • Padding & Ciphertext Stealing
  11. Chosen Ciphertext Attacks
    • Padding Oracle Attacks
    • What Went Wrong?
    • Defining CCA Security
    • A Simple CCA-Secure Scheme
  12. Message Authentication Codes
    • Definition
    • A PRF is a MAC
    • MACs for Long Messages
    • Encrypt-Then-MAC
  13. Hash Functions
    • Security Properties for Hash Functions
    • Merkle-Damgård Construction
    • Hash Functions vs. MACs: Length-Extension Attacks
  14. Authenticated Encryption & AEAD (draft)
    • Definitions
    • Achieving AE/AEAD
    • Carter-Wegman MACs
    • Galois Counter Mode for AEAD
  15. RSA & Digital Signatures
    • "Dividing" Mod N
    • The RSA Function
    • Digital Signatures
    • Chinese Remainder Theorem
    • The Hardness of Factoring N
  16. Diffie-Hellman Key Agreement
    • Cyclic Groups
    • Diffie-Hellman Key Agreement
    • Decisional Diffie-Hellman Problem
  17. Public-Key Encryption
    • Security Definitions
    • One-Time Security Implies Many-Time Security
    • ElGamal Encryption
    • Hybrid Encryption
  18. Index of security definitions

Supplementary Material

I have also provided some slide decks that visually illustrate the steps of some hybrid proofs from the text: (At the moment, these are slightly out of sync with the text; sorry!) And an interactive padding oracle attack demo:


For a second opinion, you might want to check out these other excellent references. They are also the reason I had to choose a silly name for mine -- all the good names were taken.