32 search results - page 1 / 7 » On the Use of the Negation Map in the Pollard Rho Method |
PKC
2011
Springer
12 years 7 months ago
2011
Springer
Bos, Kaihara, Kleinjung, Lenstra, and Montgomery recently showed that ECDLPs on the 112-bit secp112r1 curve can be solved in an expected time of 65 years on a PlayStation 3. This p...
ANTS
2010
Springer
13 years 7 months ago
2010
Springer
ASIACRYPT
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We propose a method to speed up the r-adding walk on multiplicative subgroups of the prime field. The r-adding walk is an iterating function used with the Pollard rho alg...
EUROCRYPT
2001
Springer
13 years 9 months ago
2001
Springer
We compare the method of Weil descent for solving the ECDLP, over extensions fields of composite degree in characteristic two, against the standard method of parallelised Pollard ...
WSC
2007
13 years 6 months ago
2007
In this paper, we propose a new asymmetric cryptographic algorithm (HOOD CRYPT) based on the Elliptical Curve Cryptographic approach. The algorithm describes how an orthogonal fre...