/
lectern.tv
Play15s30s1x0:00/--:--
DoneWatched
Expand
lectern.tv
30:44/1:40:59
1:10
3:01
7:02
4:57
3:38
0:40
3:45
3:36
2:11
3:10
1:57
2:04
5:20
1:19
7:54
4:16
2:53
1:12
1:03
4:10
4:58
3:17
0:30
1:36
3:28
0:53
2:25
2:40
4:29
8:45
2:14
Introduction to Hash-based Post-quantum Cryptography (PQC)
Professor Christof Paar walks through the mechanics of post-quantum cryptography and builds the Winternitz one-time signature scheme from scratch.
Introduces the foundational concepts of hash-based post-quantum cryptography, contrasting it with quantum computer attacks on symmetric and asymmetric ciphers. It details the vulnerabilities of traditional algorithms like RSA and ECC under Shor's algorithm, explains Grover's impact on AES, and builds up from a naive hash signature to the Winternitz One-Time Signature (W-OTS) scheme, including signing, verification, and checksum countermeasures.
Referenced inCrypto-Textbook Portal · CRYPTO (2014–2024)
Lecture Guide
- 1Symmetric ciphers like AES can be hardened against Grover's algorithm by doubling key sizes, whereas RSA and ECC are fully broken by Shor's algorithm.
- 2Post-quantum cryptography refers to classical public-key algorithms that resist quantum attacks without using quantum computation.
- 3Hash-based signatures rely on the uninvertibility of one-way hash functions rather than algebraic number theory.
- 4Basic hash-based signatures fail to incorporate the message into verification, allowing trivial message substitution attacks.
Proofs, Examples & Demos
Assumed Background