Computational complexity and cryptographic hardness: Post-Quantum Cryptography course | Zoonk
5. Computational complexity and cryptographic hardness
Introduces algorithms, runtime, polynomial and exponential growth, computational hardness, and security levels. Learners estimate how key sizes and attack costs change as computing power grows.
