Studying Hardness of Novel Assumptions in Post-Quantum Cryptography

点击翻译按钮获取中文摘要

The goal of this project is to establish connections between hard problems used to build post-quantum cryptographic primitives. This will provide necessary assurance in the more advanced cryptographic functionalities that are built assuming hardness of novel problems. The approach we take is pen-and-paper proofs of hardness implications for classes of problems. Hence, this work fits into the areas of Cryptography, Theoretical Computer Science and Mathematics.