Sciweavers

20 search results - page 1 / 4
» Computing L-Series of Hyperelliptic Curves
Sort
View
PAIRING
2007
Springer
13 years 11 months ago
Hyperelliptic Pairings
We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the research on constructing hyperelliptic curves suitable for pairing-based cryptograph...
Steven D. Galbraith, Florian Hess, Frederik Vercau...
JOC
2006
103views more  JOC 2006»
13 years 4 months ago
An Extension of Kedlaya's Algorithm to Hyperelliptic Curves in Characteristic 2
We present an algorithm to compute the zeta function of an arbitrary hyperelliptic curve over a finite field Fq of characteristic 2, thereby extending the algorithm of Kedlaya for ...
Jan Denef, Frederik Vercauteren
IEICET
2008
126views more  IEICET 2008»
13 years 5 months ago
Skew-Frobenius Maps on Hyperelliptic Curves
The hyperelliptic curve cryptosystems take most of the time for computing a scalar multiplication kD of an element D in the Jacobian JC of a hyperelliptic curve C for an integer k....
Shunji Kozaki, Kazuto Matsuo, Yasutomo Shimbara
IACR
2011
124views more  IACR 2011»
12 years 4 months ago
Group Law Computations on Jacobians of Hyperelliptic Curves
We derive an explicit method of computing the composition step in Cantor’s algorithm for group operations on Jacobians of hyperelliptic curves. Our technique is inspired by the g...
Craig Costello, Kristin Lauter
ANTS
2008
Springer
111views Algorithms» more  ANTS 2008»
13 years 7 months ago
Computing L-Series of Hyperelliptic Curves
We discuss the computation of coefficients of the L-series associated to a hyperelliptic curve over Q of genus at most 3, using point counting, generic group algorithms, and p-adic...
Kiran S. Kedlaya, Andrew V. Sutherland