Abstract
This paper gives an efficient algorithm to compute addition in Jacobian of C34 curves. The paper modifies the addition algorithm of [1], by classifying the forms of Groebner bases of all ideals involved in the addition in Jacobian, and by computing Groebner bases of ideals without using Buchberger algorithm. The algorithm computes the addition in Jacobian of C34 curves in about 3 times amount of computation of the one in elliptic curves, when the sizes of groups are set to be the same. © 2003 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Arita, S. (2003). An addition algorithm in Jacobian of C 34 curve. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2727 LNCS, pp. 93–105). https://doi.org/10.1007/3-540-45067-X_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
