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.