6251 search results - page 94 / 1251 » Randomness, Computability, and Density |
SACRYPT
2001
Springer
15 years 5 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...
101
Voted
WALCOM
2008
IEEE
15 years 2 months ago
2008
IEEE
In this paper, a fast algorithm is proposed to calculate kth power of an n
64
Voted
CORR
2010
Springer
15 years 24 days ago
2010
Springer
53
Voted
ENTCS
2007
15 years 20 days ago
2007
74
Voted
TC
2002
15 years 10 days ago
2002