Uni Reading List
Index / 001 EN
Introduction to Modern Cryptography cover

Computer Science

Computer Science

Introduction to Modern Cryptography

Jonathan Katz; Yehuda Lindell

A rigorous introduction to cryptography built on precise definitions, explicit assumptions and proofs of security. Katz and Lindell cover private-key and public-key primitives from their theoretical foundations to the schemes and standards used in practice. The revised third edition adds material on authenticated encryption, newer standards and the impact of quantum computing.

Prerequisites: Discrete mathematics, basic probability and an algorithms course; some familiarity with modular arithmetic helps.

Difficulty Level
Advanced
Academic Level
Undergraduate
cryptographyprovable securityencryptiondigital signaturespublic-key cryptographyTextbook

01 / Reading Guide

Reading Guide

Citation

Katz, J., & Lindell, Y. (2025). Introduction to Modern Cryptography (3rd ed., revised). Chapman & Hall/CRC.

Chapter Summary

The book has fifteen chapters in three parts, followed by two appendices (mathematical background; basic algorithmic number theory). Every chapter ends with references and exercises. Chapters and sections marked with an asterisk are optional: the authors state that nothing in the unstarred core depends on them.

Part I, Chapters 1–2: Introduction; Perfectly Secret Encryption

Chapter 1 sets the scene with the private-key encryption setting, historical ciphers and their cryptanalysis, and the three principles that organise everything afterwards: formal definitions, precise assumptions and proofs of security. It closes by separating provable security from real-world security. Chapter 2 defines perfect secrecy, presents the one-time pad, explains why perfect secrecy is impractical, and (in a starred section) proves Shannon's theorem.

Part II, Chapters 3–8: Private-Key (Symmetric) Cryptography

Chapter 3, "Private-Key Encryption", moves from computational security (concrete and asymptotic approaches) to definitions of secure encryption against eavesdroppers, pseudorandom generators and proofs by reduction, then to CPA-security, pseudorandom functions and permutations, and modes of operation, including stream ciphers and nonce-based encryption. Chapter 4, "Message Authentication Codes", separates integrity from secrecy and constructs MACs, including CBC-MAC, GMAC and Poly1305. Chapter 5, "CCA-Security and Authenticated Encryption", covers chosen-ciphertext attacks, authenticated encryption schemes and secure communication sessions.

Chapter 6, "Hash Functions and Applications", covers definitions, the Merkle–Damgård transform, generic attacks, the random-oracle model and further applications. Chapter 7, "Practical Constructions of Symmetric-Key Primitives", turns to stream ciphers, block ciphers and the compression functions behind hash functions. Chapter 8 (starred), "Theoretical Constructions of Symmetric-Key Primitives", builds pseudorandom generators, functions and permutations from one-way functions and hard-core predicates.

Part III, Chapters 9–15: Public-Key (Asymmetric) Cryptography

Chapter 9, "Number Theory and Cryptographic Hardness Assumptions", supplies the group theory, primes, factoring, RSA and cyclic-group assumptions the rest of the part needs. Chapter 10 (starred) covers algorithms for factoring and discrete logarithms and ends with recommended key lengths. Chapter 11, "Key Management and the Public-Key Revolution", moves from key-distribution centres to Diffie–Hellman key exchange.

Chapter 12, "Public-Key Encryption", gives definitions, hybrid encryption through the KEM/DEM paradigm, Diffie–Hellman-based encryption and RSA-based encryption, including padded RSA, OAEP and implementation pitfalls. Chapter 13, "Digital Signature Schemes", covers hash-and-sign, RSA signatures, signatures from identification schemes (Schnorr, DSA/ECDSA), certificates and public-key infrastructures, and TLS as a worked synthesis. Chapter 14 (starred), "Post-Quantum Cryptography", discusses Shor's algorithm and examples of post-quantum encryption and signatures. Chapter 15 (starred), "Advanced Topics in Public-Key Encryption", covers trapdoor permutations, Paillier, secret sharing and threshold encryption, and the Goldwasser–Micali and Rabin schemes.

Key Concepts

Chapters 1–2: Foundations

  • Three principles of modern cryptography: formal definitions, precise assumptions and proofs of security, the approach the preface credits with turning the field from an art into a science.
  • Perfect secrecy: security that holds against unbounded adversaries, achieved by the one-time pad at the price of a key as long as the message.

Chapters 3–8: Private-key cryptography

  • Computational security: security against efficient adversaries, treated in both a concrete and an asymptotic form.
  • EAV-, CPA- and CCA-security: a ladder of definitions against increasingly powerful attackers.
  • Message authentication codes and authenticated encryption: tools for integrity, and for combining secrecy with integrity.
  • Random-oracle model: an idealised model for hash functions, introduced early so that standardised public-key schemes can be treated alongside the rest.
  • Pseudorandom generators, functions and permutations: the primitives from which encryption and MACs are built.

Chapters 9–15: Public-key cryptography

  • Cryptographic hardness assumptions: factoring, RSA and the discrete-logarithm family, stated precisely.
  • Hybrid encryption (KEM/DEM): encrypting a key with public-key tools and the data with symmetric tools.
  • Digital signatures and public-key infrastructures: signing, certificates and their use in TLS.
  • Post-quantum cryptography: the effect of quantum computers on the earlier constructions.

Critical Analysis

Strengths

  • A stated method. The preface presents the book as a rigorous but introductory treatment of post-1980s cryptography, with definitions, assumptions and proofs as the organising principle, and it gives a stated prerequisite: one discrete mathematics course, with basic probability and modular arithmetic.
  • Practice alongside theory. The third edition adds nonce-based encryption, GMAC, Poly1305, GCM, CCM and ChaCha20-Poly1305, SHA-3 and the sponge construction, more elliptic-curve material, TLS 1.3 and a chapter on post-quantum cryptography. Chapter 7 is devoted to the ciphers and hash functions used in practice.
  • Built for selective reading. The asterisk system and the preface's "Guide to Using This Book" make the dependencies explicit and suggest theory, mathematics and applied "flavours" for a course.
  • Reference apparatus. Each chapter has references and exercises, and appendices review probability, asymptotic notation, finite fields and algorithmic number theory.

Limitations

  • Mathematical maturity is still required. The authors say the book uses definitions, proofs and abstract concepts, and expects some exposure to proofs; the appendices are reviews, not a substitute for a first proof-based course.
  • Cryptography only. The chapter list contains no access control, software security or network defence; apart from the TLS synthesis in Chapter 13, the book stays with cryptographic primitives and schemes and is not a security survey.
  • Edition labelling. The 2025 CRC Press printing carries the same additions as the third edition; readers comparing editions should check which printing they hold.

Where It Fits in the Course

Within this course list, Katz and Lindell is the rigorous, proof-oriented treatment of cryptography. Paar and Pelzl's Understanding Cryptography is the gentler, implementation-minded introduction that emphasises how ciphers work with less formal proof, and it is a sensible first book for readers without number theory. Stallings and Brown's Computer Security: Principles and Practice and Easttom's Computer Security Fundamentals survey security broadly, with cryptography as one component. Anderson's Security Engineering places cryptography inside whole systems, with case studies from banking, healthcare and other sectors, and Bishop's Computer Security: Art and Science treats cryptography as one implementation layer beneath policies, models and assurance.

Read Katz and Lindell after a survey or applied text, when the question changes from "which algorithm is used" to "what exactly does it guarantee and under what assumption".

How to Use This Book

The book suits advanced undergraduates, beginning graduate students and self-studying practitioners who are comfortable with discrete mathematics, basic probability, pseudocode and big-O notation. The authors cover most of the unstarred material in a one-semester (35-hour) undergraduate or master's course.

A practical plan:

  • Core: Chapters 1–6 in order, then Chapter 7 (the authors recommend at least part of it, though nothing later depends on it), then Chapter 9, Chapter 11 and as much of Chapters 12–13 as time allows.
  • Optional: the starred material. For a theoretical flavour add Section 3.2.2 and Chapter 8; for a mathematical flavour add Section 4.6, the harder parts of Chapter 9 and Chapter 10; Chapters 14 and 15 add post-quantum and advanced public-key schemes.
  • Practice: do the exercises, and write out each proof by reduction yourself before reading the book's version; the proofs of Chapters 3–5 set the pattern for the rest.