arXiv · math/0610073
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.
Explore related subjects
Keep this discovery
S. D. Galbraith, B. A. Smith. 2006-10-02. Discrete Logarithms in Generalized Jacobians. https://arxiv.org/abs/math/0610073
Cite the original work for its findings. Save a collection to share your selection of sources.