Discrete Logarithms in Generalized Jacobians

Abstract : Déchène has proposed generalized Jacobians as a source of groups for public-key cryptosystems based on the hardness of the Discrete Logarithm Problem (DLP). Her specific proposal gives rise to a group isomorphic to the semidirect product of an elliptic curve and a multiplicative group of a finite field. We explain why her proposal has no advantages over simply taking the direct product of groups. We then argue that generalized Jacobians offer poorer security and efficiency than standard Jacobians.
Type de document :
Pré-publication, Document de travail
2006
Liste complète des métadonnées

https://hal.inria.fr/inria-00537887
Contributeur : Benjamin Smith <>
Soumis le : vendredi 19 novembre 2010 - 15:56:40
Dernière modification le : mercredi 27 juillet 2016 - 14:48:48

Lien texte intégral

Identifiants

Collections

Citation

S. D. Galbraith, Benjamin Smith. Discrete Logarithms in Generalized Jacobians. 2006. 〈inria-00537887〉

Partager

Métriques

Consultations de la notice

88