Module 1
The quantum threat
4 lessonsabout 130 minFoundations / Practitioner / Advisor
After this module you can
- Explain how Shor and Grover affect symmetric and asymmetric cryptography differently
- Work through the harvest-now-decrypt-later threat on a concrete data example
- Apply Mosca's inequality and defend its inputs
Before thisM0: Lab setup and verification
- 01Refresher: symmetric and asymmetric cryptographyExplain the basic difference between symmetric (like AES) and asymmetric (like RSA/ECC) cryptography well enough to see why a quantum computer affects them differently
- 02Shor, Grover and resource estimatesExplain separately, and in the right frame, why and how Shor's algorithm breaks asymmetric cryptography (RSA, ECC) completely, and why Grover's algorithm only halves the strength of symmetric cryptography (AES)
- 03The economics of harvest now, decrypt laterExplain the mechanism of the "harvest now, decrypt later" threat (store today, decrypt tomorrow) in the right order
- 04Mosca's inequalitySet up Mosca's inequality (worry if X+Y>Z) in the right order, using Mosca's own variable definitions