13 search results - page 2 / 3 » Aspects of Hyperelliptic Curves over Large Prime Fields in S... |
ASIACRYPT
2006
Springer
13 years 8 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...
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...
AAECC
2003
Springer
13 years 8 months ago
2003
Springer
Elliptic curve cryptosystems are usually implemented over fields of characteristic two or over (large) prime fields. For large prime fields, projective coordinates are more suitabl...
CTRSA
2006
Springer
13 years 8 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 ...
CHES
2008
Springer
13 years 6 months ago
2008
Springer
Elliptic Curve Cryptosystems (ECC) have gained increasing acceptance in practice due to their significantly smaller bit size of the operands compared to other public-key cryptosyst...