Grant: Discovery Grants Program - Individual
University of Toronto
$33,000.00
Topics in cryptography and computational complexity
FY 2015-16
Summary
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)?
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
3611-2011
Name nom
Rackoff, Charles
Department département
Mathematical and Computational Sciences (Mississauga)
Organization id
31
Institution établissement
University of Toronto
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2015
Competition year année de concours
2011
Award amount
33000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
803
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer communications
Area of application fr
Téléinformatique
Research subject code
2703
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Complexity
Research subject fr
Complexité
Partie
5
Nb partie
5
Application title
Topics in cryptography and computational complexity
Keyword
NSERC
Application summary
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)?