An addition algorithm in Jacobian of C_ab curves.

DOI10.1016/S0166-218X(02)00586-3MaRDI QIDQ1408367zbMATH OpenOpenAlexFDO

Publication date 15 September 2003

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(02)00586-3

\(C_{ab}\) curves addition algorithm Gröbner basis Jacobian variety

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications to coding theory and cryptography of arithmetic geometry (14G50) Jacobians, Prym varieties (14H40) Elliptic curves (14H52) Computational aspects of algebraic curves (14Q05) Cryptography (94A60)

Review text

\(C_{ab}\) curves are affine non-singular curves having only one point at infinity, with degree one. They were introduced by \textit{S. Miura} [``Linear codes on affine algebraic curves, Trans. IEICE J. 81-A 10, 1398--1421 (1998; Japanese)] as a generalization of elliptic, hyperelliptic and superelliptic curves. As it happens with these latter families, \(C_{ab}\) curves admit affine equations of a very specific type, and this makes them potentially suitable for applications to cryptography. This paper presents an algorithm for computing the group law of the Jacobian of a \(C_{ab}\) curve in terms of a concrete affine equation. As in the above mentioned families of curves, there is a natural algorithm for the addition in the Jacobian based on a reduced form for degree zero divisors. This algorithm can be expressed in the language of ideal classes of the ring of coordinates of the curve. In this context, the use of Gröbner basis allows some shortcuts to avoid costly steps, and this leads to a more efficient implementation.

Recommendations

Cites work

Cited in

(11)

This page was built for publication: An addition algorithm in Jacobian of \(C_{ab}\) curves.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1408367)