SaTC: CORE: Small: Secure and Efficient Solutions for Post-Quantum Cryptography for Codes with Compact Representations

目前的公钥密码学是基于数学领域中的众所周知的问题，称为数论。这些问题很容易受到攻击，这些攻击能够利用量子计算机的超强计算能力(如Shor算法)。小型量子计算机已经成为现实，密码界目前正在努力设计新的加密标准，一旦足够大的量子计算机最终可用，这些标准将成为现实，使目前的加密解决方案过时。基于代码的密码学是在后量子时代提供安全密码原语的最受认可的候选方案之一。在这个项目中，我们试图从基于代码的密码学中创建高效和长期安全的密码原语。该项目的新奇之处在于调查、开发和部署技术，以获得具有高效性能和小公钥的基于代码的密码系统。该项目的影响是对美国国家标准与技术研究所(NIST)领导的标准化工作的重大贡献，以及促进美国和以色列在后量子密码学领域的足迹。由一名美国调查人员和一名以色列同行组成的研究团队提议采用一种基于所谓的可复制代码的最新方法，以缩短基于稀疏奇偶校验矩阵定义的代码的密码系统的密钥大小。其中包括NIST标准化工作的两名当前候选人，这两人都已被允许进入第二轮竞争。此外，研究人员试图结合技术来降低这种密码系统的解码失败率，以便设计允许使用静态长期密钥的方案。最后，该团队计划为所有被调查的原始人提供高效和安全的实施，这将防止侧通道攻击和其他物理和工程攻击。该奖项反映了NSF的法定使命，并通过使用基金会的智力优势和更广泛的影响审查标准进行评估，被认为值得支持。

Current public-key cryptography is based on well-known problems from the area of mathematics called Number Theory. These problems are vulnerable to attacks able to exploit the superior computational power of Quantum computers (such as Shor's algorithm). Small Quantum computers are already a reality, and the cryptographic community is currently hard at work to design the new cryptographic standards which will become actual once sufficiently large Quantum computers finally become available, making current cryptographic solutions obsolete. Code-based cryptography is one of the most accredited candidates to provide secure cryptographic primitives in the Post-Quantum era. In this project, we seek to create efficient and long-term secure cryptographic primitives from code-based cryptography. The project's novelties are the investigation, development, and deployment of techniques to obtain code-based cryptosystems featuring efficient performance and small public keys. The project's impacts are a substantial contribution to the standardization effort led by the National Institute of Standards and Technology (NIST), as well as a boost of the US and Israeli footprint in the area of post-quantum cryptography.The team of researchers, composed of a US investigator and an Israeli counterpart, proposes to employ a recent approach based on so-called Reproducible Codes to shorten the key size of cryptosystems based on codes defined by a sparse parity-check matrix. These include two of the current candidates to NIST's standardization effort, both of which have been admitted to the second round of the competition. Furthermore, the investigators seek to incorporate techniques to reduce the decoding-failure rate of such cryptosystems, in order to design schemes that allow the usage of static, long-term keys. Finally, the team plans to produce efficient and secure implementations for all the primitives investigated, which will safeguard against side-channel attacks and other physical and engineering attacksThis award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.