International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Discrete Logarithms in Generalized Jacobians

Authors:
Steven D. Galbraith
B. A. Smith
Download:
URL: http://eprint.iacr.org/2006/333
Search ePrint
Search Google
Abstract: 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.
BibTeX
@misc{eprint-2006-21824,
  title={Discrete Logarithms in Generalized Jacobians},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography / elliptic curves, algebraic tori, jacobians},
  url={http://eprint.iacr.org/2006/333},
  note={Also put on arxiv Steven.Galbraith@rhul.ac.uk 13438 received 2 Oct 2006, last revised 17 Oct 2006},
  author={Steven D. Galbraith and B. A. Smith},
  year=2006
}