20 search results - page 4 / 4 » Computing L-Series of Hyperelliptic Curves |
ASIACRYPT
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We introduce a short signature scheme based on the Computational Diffie-Hellman assumption on certain elliptic and hyper-elliptic curves. The signature length is half the...
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...
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 ...
ISCAS
2006
IEEE
13 years 11 months ago
2006
IEEE
— We propose a fast Modular Arithmetic Logic Unit (MALU) that is scalable in the digit size (d) and the field size (k). The datapath of MALU has chains of Carry Save Adders (CSA...
ASIACRYPT
2003
Springer
13 years 11 months ago
2003
Springer
The best practical algorithm for class group computations in imaginary quadratic number fields (such as group structure, class number, discrete logarithm computations) is a varian...