15 search results - page 2 / 3 » Isomorphism classes of hyperelliptic curves of genus 3 over ... |
CTRSA
2006
Springer
13 years 9 months ago
2006
Springer
The most important and expensive operation in a hyperelliptic curve cryptosystem (HECC) is scalar multiplication by an integer k, i.e., computing an integer k times a divisor D on ...
EUROCRYPT
2000
Springer
13 years 9 months ago
2000
Springer
We present an index-calculus algorithm for the computation of discrete logarithms in the Jacobian of hyperelliptic curves defined over finite fields. The complexity predicts that i...
EUROCRYPT
2009
Springer
14 years 18 days ago
2009
Springer
CHES
2004
Springer
13 years 11 months ago
2004
Springer
We present an implementation of elliptic curves and of hyperelliptic curves of genus 2 and 3 over prime fields. To achieve a fair comparison between the different types of groups,...
IEICET
2008
13 years 5 months ago
2008
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....