Grant: Discovery Grants Program - Individual
University of Waterloo
$10,000.00
Arithmetic aspects of elliptic curve cryptography
EF 2009-10
Résumé
The study of encryption schemes based on elliptic curves has attracted considerable interest
from the research community ever since their discovery 20 years ago by Miller and
(independently) Koblitz. Elliptic curve systems are unique among all public key systems in
that they have successfully maintained the highest known security levels for the longest
period of time among all such systems available today. My research aims to improve our
understanding of elliptic curve cryptosystems by investigating the mathematical foundations
of elliptic curve arithmetic. My methods combine both rigorous mathematics and cryptology
in order to achieve results that are beyond the reach of either approach in isolation. In
earlier work, I show for the first time that the security of elliptic curve cryptosystems
depends in almost all cases purely on the key size of the elliptic curve, assuming the
generalized Riemann hypothesis. I intend to build upon this work and extend these results to
hyperelliptic curve cryptosystems, while at the same time exploring new constructions of
expander graphs and public key cryptosystem designs arising from the techniques that I used.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
341769-2007
Name nom
Jao, David
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
2009
Competition year année de concours
2007
Award amount
10000
Program id
RGPIN
Program nane 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
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
Research subject code
2913
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Number theory
Research subject fr
Théorie des nombres
Partie
3
Nb partie
3
Application title
Arithmetic aspects of elliptic curve cryptography
Keyword
NA
Application summary
The study of encryption schemes based on elliptic curves has attracted considerable interest
from the research community ever since their discovery 20 years ago by Miller and
(independently) Koblitz. Elliptic curve systems are unique among all public key systems in
that they have successfully maintained the highest known security levels for the longest
period of time among all such systems available today. My research aims to improve our
understanding of elliptic curve cryptosystems by investigating the mathematical foundations
of elliptic curve arithmetic. My methods combine both rigorous mathematics and cryptology
in order to achieve results that are beyond the reach of either approach in isolation. In
earlier work, I show for the first time that the security of elliptic curve cryptosystems
depends in almost all cases purely on the key size of the elliptic curve, assuming the
generalized Riemann hypothesis. I intend to build upon this work and extend these results to
hyperelliptic curve cryptosystems, while at the same time exploring new constructions of
expander graphs and public key cryptosystem designs arising from the techniques that I used.