Collaborative Research: CT-ISG: Efficient Cryptography Based on Lattices

合作研究：CT-ISG：基于格的高效密码学

• 批准号: 1042585
• 负责人: Chris Peikert
• 金额: $ 8.21万
• 依托单位: Georgia Tech Research Corporation
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2010
• 资助国家: 美国
• 起止时间: 2010-02-01 至 2011-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1042585&HistoricalAwards=false
• 关键词: Collaborative; Research; CT; ISG; Efficient

Only two number-theoretic assumptions --- hardness of factoring and ofcomputing discrete logarithms --- underlie essentially all public-keycryptosystems in widespread use today. For lower-level primitivessuch as hash functions, random number generators, and stream ciphers,the situation is even worse: existing provably-secure constructionsare too inefficient to compete with practical alternatives such asSHA-1 or AES, and so the primitives in use today have no rigorousjustification for their security. This research will investigate new classes of computationalassumptions based on lattices. Based on these assumptions, theinvestigators will seek to design cryptographic primitives that areboth provably secure and comparably efficient to existing, deployedschemes. The research will explore the use of lattices to constructbasic cryptographic primitives, including hash functions, pseudorandomgenerators, shared-key authentication protocols, public-key encryptionschemes (including those secure against chosen-ciphertext attacks),and digital signatures. The educational component of this work willfocus on educating graduate students as well as developing introductory-level surveys of lattice-based cryptography.

只有两个数字理论假设 - - 保理和计算离散对数的硬度---基于当今广泛使用中的所有公共键合系统的基础。 对于较低级别的原始功能，作为哈希功能，随机数生成器和流密码，情况甚至更糟：现有的被证明是安全的构造效率太低，无法与ASSHA-1或AES（例如ASSHA-1或AES）竞争，因此当今使用的原始词对其安全没有严格的确定性。这项研究将研究基于晶格的新的计算量。 基于这些假设，评估者将寻求设计具有证明安全性和相当有效效率的密码原始图。 该研究将探索晶格来构建基础加密原始图，包括哈希功能，伪和加工机，共享键身份验证协议，公共钥匙加密概述（包括针对选择的封闭式文献攻击）和数字签名。 这项工作的教育组成部分WillFocus关于教育研究生以及基于晶格的加密术的入门级调查。