Grant: Discovery Grants Program - Individual
Mount Allison University
$15,000.00
Algorithmic analysis of symmetric-key cryptographic primitives
EF 2010-11
Résumé
Cryptography is the field that uses mathematical techniques to secure information. The rapid rise of computer and communications technology, especially the widespread use of the Internet, has greatly increased the demand for such techniques. For example, trillions of dollars of currency exchanges are carried out each day, and these must be encoded in such a way that malicious parties cannot view or tamper with them (even if they are sent over publicly accessible networks). Symmetric-key cryptographic primitives such as block ciphers, hash functions, and stream ciphers are fundamental components of the infrastructure that enables such transactions to be carried out securely and efficiently.
My research has been dedicated to the analysis of symmetric-key primitives for the past 10 years. Over this time, I have developed a series of new techniques (algorithms) for analyzing the strengths and weaknesses of important classes of primitives. This proposal is focused on the full development of my techniques into a cryptographic toolkit that can be readily used by other researchers who are studying existing primitives or designing new ones. I also propose to extend the rigour of the standard analysis of such primitives by removing simplifying assumptions that can hide weaknesses.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
New Brunswick, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
262074-2008
Name nom
Keliher, Liam
Department département
Mathematics and Computer Science
Organization id
74
Institution établissement
Mount Allison University
Province en
New Brunswick
Province fr
Nouveau-Brunswick
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2010
Competition year année de concours
2008
Award amount
15000
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
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
800
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
Information and communication services
Area of application fr
Services d'information et de télécommunications
Research subject code
2700
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Information technology
Research subject fr
Technologie de l'information
Partie
3
Nb partie
5
Application title
Algorithmic analysis of symmetric-key cryptographic primitives
Keyword
NSERC
Application summary
Cryptography is the field that uses mathematical techniques to secure information. The rapid rise of computer and communications technology, especially the widespread use of the Internet, has greatly increased the demand for such techniques. For example, trillions of dollars of currency exchanges are carried out each day, and these must be encoded in such a way that malicious parties cannot view or tamper with them (even if they are sent over publicly accessible networks). Symmetric-key cryptographic primitives such as block ciphers, hash functions, and stream ciphers are fundamental components of the infrastructure that enables such transactions to be carried out securely and efficiently.
My research has been dedicated to the analysis of symmetric-key primitives for the past 10 years. Over this time, I have developed a series of new techniques (algorithms) for analyzing the strengths and weaknesses of important classes of primitives. This proposal is focused on the full development of my techniques into a cryptographic toolkit that can be readily used by other researchers who are studying existing primitives or designing new ones. I also propose to extend the rigour of the standard analysis of such primitives by removing simplifying assumptions that can hide weaknesses.