Studying Hardness of Novel Assumptions in Post-Quantum Cryptography

研究后量子密码学中新假设的难度

• 批准号: 2605171
• 金额: --
• 依托单位: Royal Holloway University of London
• 依托单位国家: 英国
• 项目类别: Studentship
• 财政年份: 2021
• 资助国家: 英国
• 起止时间: 2021 至 无数据
• 项目状态: 未结题
• 来源: https://gtr.ukri.org/projects?ref=studentship-2605171
• 关键词: Studying; Hardness; Novel; Assumptions; Post

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.

该项目的目标是建立用于构建后量子密码原语的难题之间的联系。这将为更高级的加密功能提供必要的保证，这些功能是在假设新问题的硬度的情况下构建的。我们采用的方法是对问题类别的硬度含义进行纸笔证明。因此，这项工作适合密码学，理论计算机科学和数学领域。