权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

SaTC: CORE: Small: Number-theoretic aspects of lattice cryptology

SaTC：核心：小：格密码学的数论方面

基本信息

批准号：
1815562
负责人：
Stephen Miller
金额：
$ 30万
依托单位：
Rutgers University New Brunswick
依托单位国家：
美国
项目类别：
Standard Grant
财政年份：
2018
资助国家：
美国
起止时间：
2018-09-01 至 2021-08-31
项目状态：
已结题

来源：
https://www.nsf.gov/awardsearch/showAward?AWD_ID=1815562&HistoricalAwards=false
关键词：
SaTC CORE Small Number theoretic

项目摘要

This award supports research in the mathematical underpinnings of cryptography. Since the late 1970s, widely-used cryptosystems have been developed based on the perceived difficulty of certain mathematical problems. New applications, as well as improvements in attacks on existing cryptosystems, call for a better understanding of these underlying mathematical problems. In particular, the potential to develop quantum computers (and new techniques they would be able to execute) puts many existing cryptosystems, such as the well known Rivest-Shamir-Adleman (RSA) system and Elliptic Curve Cryptography, at possible long-term risk. For this reason, it is important to study post-quantum alternatives, such as lattice-based cryptology (which is the focus of this project). Lattices also offer other potential benefits, including new types of functionalities such as the ability to perform some operations on encrypted data (which would strengthen cloud security).The project centers on the cryptographic strength of special types of lattices (such as ideal lattices or integer lattices) that are used in numerous recent proposed cryptographic schemes. The investigator and collaborators intend to study the distribution of these special lattices amongst larger natural families, to see whether or not they are distinguished by presently-unknown geometric features that might make attacks possible. They plan to use techniques from automorphic forms and algebraic number theory. Tail bounds (such as Banaszczyk's tail bound for Gaussian mass) will be studied for more general regions and functions appropriate to these lattices. From a different, computational perspective, the project will explore lattice-reduction algorithms tailored for these special types of lattices, and analyze how challenging bases of these lattices can be generated.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.

该奖项支持密码学数学基础方面的研究。自20世纪70年代末以来，广泛使用的密码系统是基于某些数学问题的感知难度而开发的。新的应用程序，以及对现有密码系统攻击的改进，要求更好地理解这些潜在的数学问题。特别是，开发量子计算机（以及它们能够执行的新技术）的潜力使许多现有的密码系统，如众所周知的RSA系统和椭圆曲线密码术，面临可能的长期风险。因此，研究后量子替代方案非常重要，例如基于格的密码学（这是本项目的重点）。网格还提供了其他潜在的好处，包括新类型的功能，比如对加密数据执行某些操作的能力（这将加强云安全性）。该项目集中于特殊类型的格（如理想格或整数格）的密码强度，这些格在许多最近提出的密码方案中使用。研究者和合作者打算研究这些特殊格在更大的自然家族中的分布，看看它们是否有目前未知的几何特征来区分，这些特征可能会使攻击成为可能。他们计划使用自同构形式和代数数论的技术。尾界（如Banaszczyk的高斯质量的尾界）将研究更一般的区域和适用于这些格子的函数。从不同的计算角度来看，该项目将探索为这些特殊类型的网格量身定制的网格缩减算法，并分析如何生成这些网格的挑战性基础。该奖项反映了美国国家科学基金会的法定使命，并通过使用基金会的知识价值和更广泛的影响审查标准进行评估，被认为值得支持。