11 search results - page 1 / 3 » sacrypt 2001 |
162
Voted
SACRYPT
2001
Springer
16 years 8 hour ago
2001
Springer
135
Voted
SACRYPT
2001
Springer
16 years 8 hour ago
2001
Springer
162
Voted
SACRYPT
2001
Springer
16 years 8 hour 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")
181
Voted
SACRYPT
2001
Springer
16 years 8 hour 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...
194
Voted
SACRYPT
2001
Springer
16 years 8 hour 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...