30 search results - page 1 / 6 » Fast Cryptography in Genus 2 |
ASIACRYPT
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
ANTS
2004
Springer
13 years 10 months ago
2004
Springer
Using powerful tools on genus 2 curves like the Kummer variety, we generalize the Montgomery method for scalar multiplication to the jacobian of these curves. Previously this metho...
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
For counting points of Jacobians of genus 2 curves defined over large prime fields, the best known method is a variant of Schoof’s algorithm. We present several improvements on...
ITNG
2007
IEEE
13 years 11 months ago
2007
IEEE
This contribution proposes a modification of method of divisors group operation in the Jacobian of hyperelliptic curve over even and odd characteristic fields in projective coordi...
PAIRING
2007
Springer
13 years 11 months ago
2007
Springer
We provide the first explicit construction of genus 2 curves over finite fields whose Jacobians are ordinary, have large prime-order subgroups, and have small embedding degree. ...