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

CAREER: New Analytic Frontiers for Symmetric Cryptography

职业：对称密码学的新分析前沿

基本信息

批准号：
2046540
负责人：
Viet Tung Hoang
金额：
$ 56.4万
依托单位：
Florida State University
依托单位国家：
美国
项目类别：
Continuing Grant
财政年份：
2021
资助国家：
美国
起止时间：
2021-05-01 至 2026-04-30
项目状态：
未结题

来源：
https://www.nsf.gov/awardsearch/showAward?AWD_ID=2046540&HistoricalAwards=false
关键词：
CAREER New Analytic Frontiers Symmetric

项目摘要

Justifying security of real-world cryptographic systems is often challenging because those legacy systems were not originally designed with a provable-security goal in mind, and consequently theoretical explanations may be unsatisfactory, failing to capture the real strength of the systems. In some other cases, provably secure designs are too expensive for performance-hungry applications, and practitioners therefore have to resort to heuristic solutions. This project takes a critical step towards this long-term goal by developing new proof techniques for symmetric cryptography to understand the exact security of real-world schemes, and bridge the performance gap between provable-security designs and heuristic ones. The project studies how to build practical and provably secure Format-Preserving Encryption schemes, a tool that is widely used for encrypting credit-card numbers. The project revisits the security analyses of several widely used Random Number Generators, strengthening them with new analytic methods to obtain tight bounds. The project investigates how to give tight time-memory trade-offs for symmetric encryption schemes. The investigator develops an original problem-solving course in which students experience the full discovery process with trial-and-error, guessing, forming attack plans, and validating them. This class targets senior undergraduate students and first-year graduate students, preparing them with a proper background for doing research in theoretical computer science. Some of this material is used in the Young Scholars Program, a summer science and math program for high-school seniors in Florida.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.

证明真实世界加密系统的安全性通常具有挑战性，因为这些遗留系统最初设计时并没有考虑到可证明的安全性目标，因此理论解释可能不令人满意，无法捕捉系统的真实强度。在其他一些情况下，可证明的安全设计对于性能要求很高的应用程序来说过于昂贵，因此从业者不得不求助于启发式解决方案。该项目通过为对称密码学开发新的证明技术来了解现实世界方案的确切安全性，并弥合可证明安全性设计与启发式设计之间的性能差距，从而朝着这一长期目标迈出了关键的一步。该项目研究如何构建实用且可证明安全的保格式加密方案，这是一种广泛用于加密信用卡号码的工具。该项目回顾了几种广泛使用的随机数生成器的安全性分析，用新的分析方法加强它们以获得紧界。该项目研究了如何为对称加密方案提供紧凑的时间-内存权衡。研究者开发了一个原创的解决问题的课程，在这个课程中，学生通过试错、猜测、形成攻击计划和验证来体验完整的发现过程。本课程的目标是高年级本科生和一年级研究生，为他们做理论计算机科学的研究准备适当的背景。其中一些材料被用于“青年学者计划”，这是一个针对佛罗里达州高中高年级学生的暑期科学和数学项目。该奖项反映了美国国家科学基金会的法定使命，并通过使用基金会的知识价值和更广泛的影响审查标准进行评估，被认为值得支持。