Computational hardness assumptions are used in cryptography and algorithm design to hypothesize that certain problems cannot be solved efficiently. They are also used to create cryptographic primitives with provable security, and guide algorithm designers by assuming that simple algorithms are unlikely to refute well-studied assumptions.

Princeton University

Fall 2020

An introductory course into modern cryptography, grounded in rigorous mathematical definitions. Covers topics such as secret key and public key encryption, pseudorandom generators, and zero-knowledge proofs. Requires a basic understanding of probability theory and complexity theory, and entails some programming for course projects.

No concepts data

+ 29 more conceptsBrown University

Spring 2023

Applied Cryptography at Brown University offers a practical take on securing systems. By learning foundational cryptographic algorithms and advanced topics like zero-knowledge proofs and post-quantum cryptography, students gain both theoretical insights and hands-on experience in implementing cryptosystems using C++ and crypto libraries. Label: State-of-art concepts.

No concepts data

+ 63 more concepts