Topics in computational complexity and cryptography

计算复杂性和密码学主题

• 批准号: 3611-2006
• 负责人: Rackoff, Charles
• 金额: $ 2.19万
• 依托单位: University of Toronto
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2007
• 资助国家: 加拿大
• 起止时间: 2007-01-01 至 2008-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=366039
• 关键词: Topics; computational; complexity; cryptography

This proposal is concerned with a number of issues in cryptography and computational complexity.  What does it mean for two people to share a session-key, and what are good ways of doing this in various settings?  What are the justifications for constructions of "block ciphers" such as AES?  How can one formalize various programming paradigms such as "greedy" and "dynamic programming", and prove limitations on their power?

这个提议涉及到密码学和计算复杂性方面的一些问题。两个人共享一个会话密钥意味着什么？在不同的设置中，有什么好的方法可以做到这一点？ 构造诸如AES的“分组密码”的理由是什么？ 如何形式化各种编程范例，如“贪婪”和“动态编程”，并证明其能力的局限性？