01
Hashes, symmetric and public-key cryptography
How do two strangers agree on a secret in public?
ReadingFree
A Graduate Course in Applied Cryptography ↗Dan Boneh & Victor Shoup
Free, complete, and written by the people who build this.
Advanced · Module 11
Every other module assumes good faith. This one assumes the opposite, and the change of assumption changes everything.
By the end of this module
You can reason about adversaries rather than users, and you know why you must never roll your own crypto.
How do two strangers agree on a secret in public?
Dan Boneh & Victor Shoup
Free, complete, and written by the people who build this.
Where do real systems break, given unbreakable maths?
Which of today's cryptography survives a quantum computer?
NIST
The standards that will replace RSA and elliptic curves.
Quiz
Not written yet for this module. The lectures above are complete and the module still counts toward your progress.