Discrete Logarithms in Generalized Jacobians

D\'ech\`ene 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...

Full description

Saved in:
Bibliographic Details
Main Authors Galbraith, S. D, Smith, B. A
Format Journal Article
LanguageEnglish
Published 02.10.2006
Subjects
Mathematics - Number Theory
Online AccessGet full text

Cover

More Information
Summary:D\'ech\`ene 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.
DOI:10.48550/arxiv.math/0610073