37 search results - page 6 / 8 » Fast Algorithms for Elliptic Curve Cryptosystems over Binary... |
IEICET
2008
13 years 7 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....
ANTS
1998
Springer
13 years 11 months ago
1998
Springer
In 1986, following the work of Schoof on counting points on elliptic curves over finite fields, new algorithms for primality proving emerged, due to Goldwasser and Kilian on the on...
WAIFI
2010
Springer
14 years 15 days ago
2010
Springer
A cryptographic pairing evaluates as an element of a finite extension field, and the evaluation itself involves a considerable amount of extension field arithmetic. It is recogn...
IJNSEC
2008
13 years 7 months ago
2008
Elliptic Curve Cryptography (ECC) is a promising alternative for public-key algorithms in resource-constrained systems because it provides a similar level of security with much sh...
EUROCRYPT
2000
Springer
13 years 11 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...