LECTURES A GRATIS GLOBAL SERVICE
⌕ SEARCH GRATIS GLOBAL ↗
LECTURES
Lecture 10: Cryptography
SOURCE: YOUTUBE · NO TRACKING UNTIL YOU PRESS PLAY · TROUBLE PLAYING? WATCH AT THE SOURCE ↗

Lecture 10: Cryptography

81 MIN · EN · STATUS: [ STREAMING ]
RATE THIS
MIT · Mathematics for Computer Science · LECTURE 10

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.

At a glance

Lecture facts

Runtime compared with the other 507 Mathematics lectures
Runtime1 h 21 m
Compared with MathematicsLonger than 81%
This series

Mathematics for Computer Science

Every lecture in order, sized by its length.

  • Earlier lectures
  • This lecture
  • Still to come
Lecture 8 of 229 h 19 m before this · 29 h 3 m in total

More from this course

12 LECTURES
Predicates, Sets, and Proofs

Predicates, Sets, and Proofs

MIT · 79 MIN
Contradiction and Induction

Contradiction and Induction

MIT · 80 MIN
State Machines

State Machines

MIT · 81 MIN
Lecture 5: Sums

Lecture 5: Sums

MIT · 82 MIN
Lecture 6: Asymptotics

Lecture 6: Asymptotics

MIT · 78 MIN
Divisibility

Divisibility

MIT · 79 MIN
Modular Arithmetic

Modular Arithmetic

MIT · 80 MIN
Graphs and Coloring

Graphs and Coloring

MIT · 81 MIN
Lecture 12: Matching

Lecture 12: Matching

MIT · 82 MIN
Lecture 13: Connectivity and Trees

Lecture 13: Connectivity and Trees

MIT · 82 MIN
Digraphs and DAGs

Digraphs and DAGs

MIT · 79 MIN
Relations and Counting

Relations and Counting

MIT · 79 MIN