Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Waterloo

$14,000.00

Number-theoretic cryptography

EF 2006-07

Résumé
Public-key cryptosystems are a key technology widely deployed by private, commercial and governmental users to ensure privacy and authenticity in electronic data communications. The security of most public-key cryptographic systems is based on the difficulty of a certain number-theoretic problem. These problems are believed, but not proven, to be hard. The most popular example is the integer factorization problem, which forms the basis for the Rivest-Shamir-Adleman (RSA) cryptosystem. Examples relevant for this proposal are the discrete logarithm problem in the group of points on an elliptic curve (ECDLP) and the problem of finding solutions to systems of multivariate quadratic (MQ) equations over finite fields. The proposed research is to further explore the number-theoretic and algebraic properties of selected public-key cryptosystems. This includes both security-related aspects and aspects of efficiency.   Specifically, we expect to identify further possibly less secure instances of the ECDLP. Such results are of extreme interest to both researchers and practitioners, given that elliptic curve-based cryptosystems represent the most efficient security-enhancing solution in constrained computing environments such as smart cards. We further expect to generate optimal system parameters for high-security applications of cryptosystems using bilinear pairings. The use of bilinear pairings in cryptography has led to exciting novel applications such as the first workable and provably secure identity-based encryption scheme. Moreover, we expect to achieve a better understanding of the security of cryptosystems based on MQ equations. Such cryptosystems have the added advantage that they are not vulnerable to attacks performed by quantum computers. In our research, we will be using tools from computational number theory and algebraic geometry, combining experimental work and theoretical investigation.
Programme
Discovery Grants Program - Individual
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
238473-2006
Name nom
Teske, Edlyn
Department département
Combinatorics and Optimization
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2006
Competition year année de concours
2006
Award amount
14000
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
336
Committee name en
Pure & Applied Maths - A
Committee name fr
Maths pures et appliquées - A
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Partie
1
Nb partie
5
Application title
Number-theoretic cryptography
Keyword
NA
Application summary
Public-key cryptosystems are a key technology widely deployed by private, commercial and governmental users to ensure privacy and authenticity in electronic data communications. The security of most public-key cryptographic systems is based on the difficulty of a certain number-theoretic problem. These problems are believed, but not proven, to be hard. The most popular example is the integer factorization problem, which forms the basis for the Rivest-Shamir-Adleman (RSA) cryptosystem. Examples relevant for this proposal are the discrete logarithm problem in the group of points on an elliptic curve (ECDLP) and the problem of finding solutions to systems of multivariate quadratic (MQ) equations over finite fields. The proposed research is to further explore the number-theoretic and algebraic properties of selected public-key cryptosystems. This includes both security-related aspects and aspects of efficiency.   Specifically, we expect to identify further possibly less secure instances of the ECDLP. Such results are of extreme interest to both researchers and practitioners, given that elliptic curve-based cryptosystems represent the most efficient security-enhancing solution in constrained computing environments such as smart cards. We further expect to generate optimal system parameters for high-security applications of cryptosystems using bilinear pairings. The use of bilinear pairings in cryptography has led to exciting novel applications such as the first workable and provably secure identity-based encryption scheme. Moreover, we expect to achieve a better understanding of the security of cryptosystems based on MQ equations. Such cryptosystems have the added advantage that they are not vulnerable to attacks performed by quantum computers. In our research, we will be using tools from computational number theory and algebraic geometry, combining experimental work and theoretical investigation.