6 search results - page 1 / 2 » Improving the Complexity of Index Calculus Algorithms in Ell... |
EUROCRYPT
2012
Springer
11 years 7 months ago
2012
Springer
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
ASIACRYPT
1999
Springer
13 years 8 months ago
1999
Springer
In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We pres...
IJNSEC
2008
13 years 4 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...
DCC
2000
IEEE
13 years 4 months ago
2000
IEEE
It has become increasingly common to implement discrete-logarithm based public-key protocols on elliptic curves over finite fields. The basic operation is scalar multiplication: ta...
ANTS
1998
Springer
13 years 8 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...