CAREER: Concrete Hardness in Lattice-based Cryptography

职业：基于格的密码学的具体硬度

• 批准号: 2044855
• 负责人: Shi Bai
• 金额: $ 50.07万
• 依托单位: Florida Atlantic University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2021
• 资助国家: 美国
• 起止时间: 2021-05-15 至 2026-04-30
• 项目状态: 未结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=2044855&HistoricalAwards=false
• 关键词: CAREER; Concrete; Hardness; Lattice; based

With recent advances in quantum computing, cryptosystems tailored to be quantum-safe are of great interest. One of the most promising candidates for post-quantum cryptography is lattice-based cryptography. The security of lattice-based cryptography however relies on the computational hardness of certain lattice-based assumptions. The central goal of this project is to understand the concrete hardness of these assumptions, investigating algorithms for the worst-case and average-case lattice problems. The project aims to provide new insights into the concrete behavior of lattice algorithms and understand their detailed resource requirements. The integrated educational component of the project involves a combination of mentoring, course (re)-design and science communication activities, contributing to the development of a diverse STEM workforce.The main research activities in the project include: (1) understand and improve the lattice reduction algorithms, including the underlying enumeration and sieving algorithms, with a focus on their concrete complexities; (2) investigate the impacts of deploying classical and quantum algorithms in lattice reduction, and estimate their detailed resource requirement; (3) develop robust models to guide the parameter selection for lattice-based cryptographic systems. The research findings provide a systematic approach to quantitatively understand the intrinsic hardness of lattice assumptions. These results contribute to the standardization process for post-quantum cryptography, guide the parameter selection, and provide a systematic tool to the developers and end-users of lattice-based cryptography. The research outcomes are to be published in peer-reviewed publications for the academic community and to be disseminated to a broader audience through the education and outreach activities.This 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.

随着量子计算的最新进展，量子安全的密码系统引起了人们的极大兴趣。后量子密码学最有前途的候选者之一是基于格的密码学。然而，基于格的密码学的安全性依赖于某些基于格的假设的计算硬度。这个项目的中心目标是了解这些假设的具体难度，研究最坏情况和平均情况下的格子问题的算法。该项目旨在为格型算法的具体行为提供新的见解，并了解其详细的资源需求。该项目的综合教育部分包括指导、课程（重新）设计和科学传播活动，有助于培养多元化的STEM劳动力。该项目的主要研究活动包括：（1）了解和改进格约简算法，包括底层的枚举和筛选算法，重点是它们的具体复杂性;（2）研究经典算法和量子算法在格约简中的应用，并估算其具体的资源需求;（3）建立鲁棒模型，指导格密码系统的参数选择。研究结果提供了一个系统的方法来定量地了解晶格假设的内在硬度。这些结果有助于后量子密码学的标准化进程，指导参数选择，并为基于格的密码学的开发者和最终用户提供系统的工具。研究成果将发表在学术界同行评审的出版物上，并通过教育和推广活动传播给更广泛的受众。该奖项反映了NSF的法定使命，并被认为值得通过使用基金会的知识价值和更广泛的影响审查标准进行评估来支持。

项目成果

Fiat-Shamir Signatures Based on Module-NTRU

基于 Module-NTRU 的 Fiat-Shamir 签名

• 发表时间: 2022
• 期刊: Information Security and Privacy: 27th Australasian Conference
• 作者: Bai, Shi;Beard, Austin;Johnson, Floyd;K. B. Vidhanalage, Sulani;Ngo, Tran.
• 通讯作者: Ngo, Tran.

Lattice Reduction with Approximate Enumeration Oracles: Practical Algorithms and Concrete Performance

• DOI: 10.1007/978-3-030-84245-1_25
• 发表时间: 2020
• 期刊: IACR Cryptol. ePrint Arch.
• 作者: Martin R. Albrecht;Shi Bai;Jianwei Li;Joe Rowell

TINA: TMVP-Initiated Novel Accelerator for Lightweight Ring-LWE-Based PQC

• DOI: 10.1109/tvlsi.2023.3341037
• 发表时间: 2024-05
• 期刊: IEEE Transactions on Very Large Scale Integration (VLSI) Systems
• 影响因子: 2.8
• 作者: Tianyou Bao;Pengzhou He;Shi Bai;Jiafeng Xie

Concrete Analysis of Quantum Lattice Enumeration

量子点阵枚举的具体分析

• 发表时间: 2023
• 期刊: Lecture notes in computer science
• 作者: Bai, Shi;van Hoof, Maya-Iggy;Johnson, Floyd B;Lange, Tanja;Ngo, Tran
• 通讯作者: Ngo, Tran