Computational complexity and cryptography

This area focuses on the intersection of computational complexity theory and cryptography, exploring how hardness assumptions, complexity classes and reductions underpin the security of cryptographic primitives and protocols. It includes the study of secure computation, cryptographic proof techniques, and the classification of problems according to their computational difficulty.