The Pollard rho method on a cyclic group G traces a random walk over G by iteratively applying a function to G. The discrete logarithm of the target can be ...
In this paper, we propose a variant of the Pollard rho method. We use an iterating function whose image size is much smaller than its domain and hence ...
Missing: Fpm. | Show results with:Fpm.
Subset-Restricted Random Walks for Pollard rho Method on F<sub>p<sup>m</sup></sub>. Authors: Minkyu Kim · Jung Hee Cheon · Jin Hong. Download:.
Missing: Fpm. | Show results with:Fpm.
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
People also ask
What is the Pollard's rho method?
What is the Pollard's rho heuristic?
A method to speed up the r -adding walk on multiplicative subgroups of the prime field with significantly reduced execution time for each iteration using a ...
More precisely, a specific function F : G → G is fixed and the random walk is generated by iteratively applying F, starting from a random group element.
BETTER RANDOM WALKS FOR POLLARD ' S RHOMETHODEDLYN TESKEAbstract. Subset-Restricted Random Walks for Pollard rho Method on Fpm. Minkyu Kim, J. Cheon, Jin Hong.
We propose a variant of the Pollard rho method to take advantage of this feature, and achieve the speedup by a factor of m, rather than 3p−34p−3m, the ...
Nov 12, 2010 · Hong, Subset-restricted random walks for Pollard rho method on Fpm , in PKC. '09. LNCS, vol. 5443 (Springer, Berlin, 2009), pp. 54–67. [12] ...
We propose a variant of the Pollard rho method to take advantage of this feature, and achieve the speedup by a factor of m, rather than 3p−34p−3m, the previous ...