13 search results - page 1 / 3 » Construction of Secure Random Curves of Genus 2 over Prime F... |
EUROCRYPT
2004
Springer
15 years 4 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...
ASIACRYPT
2006
Springer
15 years 2 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...
PAIRING
2007
Springer
15 years 4 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. ...
CHES
2004
Springer
15 years 4 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,...
ITNG
2007
IEEE
15 years 5 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...