6251 search results - page 94 / 1251 » Randomness, Computability, and Density |
SACRYPT
2001
Springer
14 years 2 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...
WALCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
In this paper, a fast algorithm is proposed to calculate kth power of an n
CORR
2010
Springer
13 years 10 months ago
2010
Springer
ENTCS
2007
13 years 10 months ago
2007
TC
2002
13 years 9 months ago
2002