Topics in cryptography and computational complexity

密码学和计算复杂性主题

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

This proposal is concerned with a number of issues in cryptography and computational complexity. The most basic issues in computational complexity involve trying to show that certain computational problems require enormous, impractical amounts of computer time. In the setting of cryptography, in fact, we actually want it to be the case that an adversary cannot break the system in a reasonable amount of time. In this project we study a number of specific questions related to cryptography. What does it mean for two people to share a session-key, and what are good ways of doing this in various settings, such as a public key infrastructure? How can we protect our algorithms against insecure hardware they might run on? What are the justifications for constructions of "block ciphers" such as AES (Advanced Encryption System)?

该建议涉及密码学和计算复杂性中的许多问题。