Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Ottawa

$14,000.00

Cryptographic properties of generalized Jacobians

EF 2007-08

Résumé
The motivation behind our research came from the observation that several practical discrete logarithm-based cryptosystems, such as ElGamal, the Elliptic and Hyperelliptic Curve Cryptosystems, XTR, the Lucas-based cryptosystem LUC as well as the torus-based cryptosystem CEILIDH, can all naturally be reinterpreted in terms of generalized Jacobians. One can however remark a dichotomy since the underlying structures of these cryptosystems either pertain to algebraic tori or to usual Jacobians.Our doctoral dissertation therefore focused on the simplest generalized Jacobians of an elliptic curve in order to demonstrate that these semi-abelian varieties also satisfy the criteria needed to be suitable for DL-based cryptography. It then follows that the generalized Jacobians presenting a cryptographic potential strictly contains algebraic tori and usual Jacobians.This theoretical result then raises several questions on the potential use of generalized Jacobians in cryptography. We propose for instance to study the Computational Diffie-Hellman Problem in these group extensions. At another level, it would be equally interesting to exploit the intrinsic link between the generalized Jacobians and the ray class groups (RCG).  The parallel between these two constructions would then allow an interpretation of the known cryptographic properties of the RCG in terms of generalized Jacobians.These chosen examples then confirm that the exploration of the cryptographic properties of the generalized Jacobians is a very natural program of research that is still in its infancy.
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
341735-2007
Name nom
Déchène, Isabelle
Department département
Mathematics and Statistics
Organization id
28
Institution établissement
University of Ottawa
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2007
Competition year année de concours
2007
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
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
1
Nb partie
5
Application title
Cryptographic properties of generalized Jacobians
Keyword
NA
Application summary
The motivation behind our research came from the observation that several practical discrete logarithm-based cryptosystems, such as ElGamal, the Elliptic and Hyperelliptic Curve Cryptosystems, XTR, the Lucas-based cryptosystem LUC as well as the torus-based cryptosystem CEILIDH, can all naturally be reinterpreted in terms of generalized Jacobians. One can however remark a dichotomy since the underlying structures of these cryptosystems either pertain to algebraic tori or to usual Jacobians.Our doctoral dissertation therefore focused on the simplest generalized Jacobians of an elliptic curve in order to demonstrate that these semi-abelian varieties also satisfy the criteria needed to be suitable for DL-based cryptography. It then follows that the generalized Jacobians presenting a cryptographic potential strictly contains algebraic tori and usual Jacobians.This theoretical result then raises several questions on the potential use of generalized Jacobians in cryptography. We propose for instance to study the Computational Diffie-Hellman Problem in these group extensions. At another level, it would be equally interesting to exploit the intrinsic link between the generalized Jacobians and the ray class groups (RCG).  The parallel between these two constructions would then allow an interpretation of the known cryptographic properties of the RCG in terms of generalized Jacobians.These chosen examples then confirm that the exploration of the cryptographic properties of the generalized Jacobians is a very natural program of research that is still in its infancy.