Paper Info
Title
Improving Group Law Algorithms for Jacobians of Hyperelliptic Curves
Abstract
In this paper, we propose three ideas to speed up the computation of the group operation in the Jacobian of a hyperelliptic curve: 1  Division of polynomials without inversions in the base field, and an extended gcd algorithm which uses only one inversion in the base field. 2  The omission of superfluous calculations in the reduction part. 3  Expressing points on the Jacobian in a slightly different form.
Year
DOI
Venue
2000
10.1007/10722028_28
ANTS
Keywords
Field
DocType
hyperelliptic curves,improving group law algorithms,hyperelliptic curve
Discrete mathematics,Hyperelliptic curve,Jacobian matrix and determinant,Algebra,Cryptography,Euclidean algorithm,Hyperelliptic curve cryptography,Calculus,Mathematics,Elliptic curve,Speedup,Computation
Conference
Volume
ISSN
ISBN
1838
0302-9743
3-540-67695-3
Citations 
PageRank 
References 
14
0.97
3
Authors
1
Name
Order
Citations
PageRank
Koh-Ichi Nagao1366.17