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

SaTC：核心：小型：用于具有紧凑表示的代码的后量子密码学的安全高效解决方案

• 批准号: 1906360
• 负责人: Edoardo Persichetti
• 金额: $ 49.99万
• 依托单位: Florida Atlantic University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2019
• 资助国家: 美国
• 起止时间: 2019-07-01 至 2023-06-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1906360&HistoricalAwards=false
• 关键词: SaTC; CORE; Small; Secure; Efficient

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.

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

项目成果

Take your MEDS: Digital Signatures from Matrix Code Equivalence

• DOI: 10.1007/978-3-031-37679-5_2
• 发表时间: 2022
• 作者: T. Chou;R. Niederhagen;Edoardo Persichetti;T. Randrianarisoa;Krijn Reijnders;Simona Samardjiska;Monika Trimoska

Reproducible families of codes and cryptographic applications

• DOI: 10.1515/jmc-2020-0003
• 发表时间: 2021-01
• 期刊: Journal of Mathematical Cryptology
• 影响因子: 1.2
• 作者: Paolo Santini;Edoardo Persichetti;M. Baldi

On the computational hardness of the code equivalence problem in cryptography

密码学中代码等价问题的计算难度

• DOI: 10.3934/amc.2022064
• 发表时间: 2023
• 期刊: Advances in Mathematics of Communications
• 影响因子: 0.9
• 作者: Barenghi, Alessandro;Biasse, Jean-François;Persichetti, Edoardo;Santini, Paolo
• 通讯作者: Santini, Paolo

On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography

• DOI: 10.1007/978-3-031-15255-9_2
• 发表时间: 2022
• 期刊: IACR Cryptol. ePrint Arch.
• 作者: Edoardo Persichetti;T. Randrianarisoa

On Constant-Time QC-MDPC Decoders with Negligible Failure Rate

故障率可忽略不计的恒定时间 QC-MDPC 解码器

• DOI: 10.1007/978-3-030-54074-6_4
• 发表时间: 2020
• 期刊: Lecture notes in computer science
• 作者: Drucker, Nir;Gueron, Shay;Kostic, Dusan
• 通讯作者: Kostic, Dusan