Complexity Classes: P and NPExplores complexity classes P and NP, highlighting solvable and verifiable problems, including NP-complete challenges.
Elements of Computational ComplexityIntroduces computational complexity, decision problems, quantum complexity, and probabilistic algorithms, including NP-hard and NP-complete problems.
Cryptographic Security FundamentalsCovers cryptographic security fundamentals, including collision search algorithms, public-key cryptography, and risks of underestimating collision attacks.
Cryptographic Security ModelsExplores Cryptographic Security Models, including Diffie-Hellman and ElGamal Security, RSA, and practical encryption problems.
Density Operator FormalismCovers the density operator formalism, polynomial time, NP problems, BPP, QMA, and probabilistic algorithms.
