11 search results - page 1 / 3 » sacrypt 2001 |
SACRYPT
2001
Springer
13 years 10 months ago
2001
Springer
SACRYPT
2001
Springer
13 years 10 months ago
2001
Springer
SACRYPT
2001
Springer
13 years 10 months ago
2001
Springer
![Fast Generation of Pairs (k, [k]P) for Koblitz Elliptic Curves](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/fast_generation_of_pairs_k_k_p_for_koblitz_elliptic_curves_SACRYPT_2001.jpg "Fast Generation of Pairs (k, [k]P) for Koblitz Elliptic Curves")
SACRYPT
2001
Springer
13 years 10 months ago
2001
Springer
This paper compares different approaches for computing power products 1≤i≤k gei i in finite groups. We look at the conventional simultaneous exponentiation approach and prese...
SACRYPT
2001
Springer
13 years 10 months ago
2001
Springer
This paper extends the analysis of Pollard’s rho algorithm for solving a single instance of the discrete logarithm problem in a finite cyclic group G to the case of solving more...