An addition algorithm in Jacobian of \(C_{ab}\) curves. (Q1408367)

\(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.