Permuted Puzzles and Cryptographic Hardness

Permuted Puzzles and Cryptographic Hardness

Explore a thought-provoking conference talk presented at TCC 2019 that delves into the intriguing relationship between permuted puzzles and cryptographic hardness. Gain insights into cutting-edge research in cryptography as the speaker examines the complexities of puzzle permutations and their implications for cryptographic security. Discover how these concepts contribute to the advancement of cryptographic theory and practice in this engaging 26-minute presentation.