
Lecture 10: Cryptography
MIT lecturer Brynmor Chapman explains how number theory underpins modern cryptography, part of the course Mathematics for Computer Science (6.1200J). Building on earlier lectures covering GCDs and modular arithmetic, the session shows why these tools matter for computer security, connecting abstract number theory to practical encryption schemes. Chapman works through the mathematics step by step on the board, demonstrating how modular exponentiation and related properties make public key cryptography possible. The lecture assumes the groundwork laid in prior sessions on basic number theory and builds toward the algorithms that protect digital communication. It is a standard lecture hall recording, instructor at the board with students present, focused entirely on working through proofs and problems rather than slides or demonstrations. Eighty minutes of structured mathematical reasoning aimed at computer science students learning why GCDs and modular arithmetic are not just abstract curiosities but the backbone of secure systems.