6251 search results - page 94 / 1251 » Randomness, Computability, and Density |
132
click to vote
SACRYPT
2001
Springer
15 years 8 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...
126
click to vote
WALCOM
2008
IEEE
15 years 5 months ago
2008
IEEE
In this paper, a fast algorithm is proposed to calculate kth power of an n
85
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
73
Voted
ENTCS
2007
15 years 3 months ago
2007
102
Voted
TC
2002
15 years 3 months ago
2002