Arithmetic of generalized jacobians

Authors:
Isabelle Déchène
Affiliations:
Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada
Venue:
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Year:
2006

Citing 2
Cited 1

Use of elliptic curves in cryptography

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Hyperelliptic cryptosystems

Journal of Cryptology

Generalised jacobians in cryptography and coding theory

WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper aims at introducing generalized Jacobians as a new candidate for discrete logarithm (DL) based cryptography. The motivation for this work came from the observation that several practical DL-based cryptosystems, such as ElGamal, the Elliptic and Hyperelliptic Curve Cryptosystems, XTR, LUC as well as CEILIDH can all naturally be reinterpreted in terms of generalized Jacobians. However, usual Jacobians and algebraic tori are thus far the only generalized Jacobians implicitly utilized in cryptography. In order to go one step further, we here study the simplest nontrivial generalized Jacobians of an elliptic curve. In this first of a series of articles, we obtain explicit formulæ allowing to efficiently perform arithmetic operations in these groups. This work is part of our doctoral dissertation, where security aspects are considered in depth. As a result, these groups thus provide the first concrete example of semi-abelian varieties suitable for DL-based cryptography.