Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of Calgary

$38,000.00

Algorithms in number theory and cryptography

FY 2017-18

Summary
In the past few decades, cryptography, the study of data security, has emerged as an important concern in our society. As our personal information becomes increasingly accessible through the Internet, the need to protect and authenticate data is more imperative than ever. The security of many methods in modern public-key cryptography relies on the supposed difficulty of certain computational problems in mathematics and, in particular, number theory. These schemes are set up in such a way that presumably the only way for an attacker to break the given system is to solve an instance of one such problem. Currently, very few number-theoretic problems are widely accepted as foundations for secure public-key protocols. Furthermore, most of these problems have strong theoretical relationships. In many cases, being able to solve one efficiently implies the ability to solve another efficiently as well. In other words, one dramatic mathematical discovery could render many current public-key cryptographic techniques insecure. I intend to investigate the suitability of certain problems in algebraic number theory and algebraic geometry as alternatives for public-key cryptography. This will involve improving the efficiency of algorithms for computing with the basic objects of interest, studying theoretically and algorithmically the difficulty of the supposed hard problems, and conducting general investigations into the associated algebraic number theoretic objects. For example, there are a number of extremely difficult computational problems in this area, of interest in computational mathematics in their own right, that have also been proposed for cryptographic applications, but much more investigation is needed in terms of their security and efficiency. By attempting to devise new, more efficient methods to solve these problems, I will provide other researchers with a much firmer foundation on which to base their assessments of these cryptographic protocols. The end result will be a suite of secure and efficient cryptographic protocols, whose performance characteristics and trade-offs are well-quantified and understood, that can be used to protect Internet communications, even if currently-used protocols are found to be insecure. Canadian security agencies and companies will be able to use these results to better inform their decisions on security policy, and the trainees working on these projects will develop valuable skills for future employment in both the private and public sectors.
Program
Discovery Grants Program - Individual
Location
Alberta, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
RGPIN-2016-04545
Name nom
Jacobson, Jr, Michael
Department département
Computer Science - Computer Science
Organization id
11
Institution établissement
University of Calgary
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2017
Competition year année de concours
2016
Award amount
38000
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
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
2714
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Mathematics of computing
Research subject fr
Mathématiques de l'informatique
Partie
2
Nb partie
5
Application title
Algorithms in number theory and cryptography
Keyword
NSERC
Application summary
In the past few decades, cryptography, the study of data security, has emerged as an important concern in our society. As our personal information becomes increasingly accessible through the Internet, the need to protect and authenticate data is more imperative than ever. The security of many methods in modern public-key cryptography relies on the supposed difficulty of certain computational problems in mathematics and, in particular, number theory. These schemes are set up in such a way that presumably the only way for an attacker to break the given system is to solve an instance of one such problem. Currently, very few number-theoretic problems are widely accepted as foundations for secure public-key protocols. Furthermore, most of these problems have strong theoretical relationships. In many cases, being able to solve one efficiently implies the ability to solve another efficiently as well. In other words, one dramatic mathematical discovery could render many current public-key cryptographic techniques insecure. I intend to investigate the suitability of certain problems in algebraic number theory and algebraic geometry as alternatives for public-key cryptography. This will involve improving the efficiency of algorithms for computing with the basic objects of interest, studying theoretically and algorithmically the difficulty of the supposed hard problems, and conducting general investigations into the associated algebraic number theoretic objects. For example, there are a number of extremely difficult computational problems in this area, of interest in computational mathematics in their own right, that have also been proposed for cryptographic applications, but much more investigation is needed in terms of their security and efficiency. By attempting to devise new, more efficient methods to solve these problems, I will provide other researchers with a much firmer foundation on which to base their assessments of these cryptographic protocols. The end result will be a suite of secure and efficient cryptographic protocols, whose performance characteristics and trade-offs are well-quantified and understood, that can be used to protect Internet communications, even if currently-used protocols are found to be insecure. Canadian security agencies and companies will be able to use these results to better inform their decisions on security policy, and the trainees working on these projects will develop valuable skills for future employment in both the private and public sectors.