The Joy of Cryptography

Contents
1. Unconditional Cryptography
  
  One-Time Pad & the Provable Security Mindset
  
  Rudiments of Provable Security
  
  ☆ Secret Sharing
2. Pseudorandomness
  
  Modern Computational Cryptography
  
  Pseudorandom Generators
  
  Pseudorandom Functions
  
  Pseudorandom Permutations
3. Symmetric-Key Encryption
  
  Chosen-Plaintext Attacks Against Encryption
  
  Chosen-Ciphertext Attacks Against Encryption
4. Hashing
  
  Collision-Resistant Hash Functions
  
  ☆ Universal Hash Functions
  
  Random Oracles and Other Idealized Models
5. Asymmetric-Key Cryptography
  
  Key Exchange
  
  Public-Key Encryption
  
  RSA
  
  Digital Signatures
6. Advanced Topics
  
  Encrypted Messaging & Ratcheting
  
  Authenticated Key Exchange
  
  Zero-Knowledge Proofs
  
  Post-Quantum Cryptography
7. Appendix
  
  Math Review
  
  Binary Finite Fields
  
  Bibliography
About

20

Advanced Topics

Post-Quantum Cryptography

Chapter Contents

Chapter Contents

20.1.Capabilities of quantum computing
20.1.1.Attacking symmetric-key cryptography
20.1.2.Breaking asymmetric-key cryptography
20.2.The learning-with-errors problem
20.3.Key exchange from LWE
Exercises
Chapter Notes & References

Previous Chapter19. Zero-Knowledge Proofs

This chapter will become available online in July 2026.

Previous Chapter19. Zero-Knowledge Proofs

The Joy of Cryptography

An undergraduate-level textbook that introduces students to the fundamentals of provable security.

About this Book

Acknowledgements

This book is possible with support from the National Science Foundation and the Open Textbook Initiative at Oregon State University.

Unconditional Cryptography
Pseudorandomness
Symmetric-Key Encryption
1. Chosen-Plaintext Attacks Against Encryption
2. Chosen-Ciphertext Attacks Against Encryption
Hashing
Asymmetric-Key Cryptography
Advanced Topics
Appendix

The Joy of Cryptography is by Mike Rosulek and made available under Creative Commons CC-BY-ND-NC license.

Site design by Nicholas Rougeux