Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata
Contributor : Benjamin Smith Connect in order to contact the contributor
Submitted on : Friday, November 19, 2010 - 3:56:40 PM
Last modification on : Wednesday, July 27, 2016 - 2:48:48 PM

Links full text




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



Record views