Pollard's rho algorithm is a special-purpose integer factorization algorithm. It was invented by John Pollard in 1975. It is particularly effective… (More)

Semantic Scholar uses AI to extract papers important to this topic.

Review

2015

Review

2015

- Silje Christensen, Simen Johnsrud
- 2015

In order to understand the threat model of elliptical curve cryptographic schemes it is important to have the knowledge of how… (More)

Is this relevant?

2015

2015

Elliptic curve cryptographic protocols often make use of the inherent hardness of the discrete logarithm problem, which is to… (More)

Is this relevant?

2013

2013

- Anjan K. Koundinya, G. Harish, +4 authors G. Punith Kumar
- ArXiv
- 2013

Integer factorization is one of the vital algorithms discussed as a part of analysis of any black-box cipher suites where the… (More)

Is this relevant?

2010

2010

- Jung Hee Cheon, Jin Hwa Hong, Minkyu Kim
- Journal of Cryptology
- 2010

Most generic and memory-efficient algorithms for solving the discrete logarithm problem construct a certain random graph… (More)

Is this relevant?

2006

2006

- Stephen D. Miller, Ramarathnam Venkatesan
- ANTS
- 2006

We show that the classical Pollard ρ algorithm for discrete logarithms produces a collision in expected time O( √ n(log n)). This… (More)

Is this relevant?

2005

2005

- Ramzi A. Haraty, Hadi Otrok, Abdul Nasser El-Kassar
- The 3rd ACS/IEEE International Conference…
- 2005

Summary form only given. In 1985 a powerful and practical public-key scheme was produced by ElGamal; his work was applied using… (More)

Is this relevant?

2001

2001

- Fabian Kuhn, René Struik
- Selected Areas in Cryptography
- 2001

This paper extends the analysis of Pollard’s rho algorithm for solving a single instance of the discrete logarithm problem in a… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Edlyn Teske
- Math. Comput.
- 2001

We consider Pollard’s rho method for discrete logarithm computation. Usually, in the analysis of its running time the assumption… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Edlyn Teske
- ANTS
- 1998

In Pollard's rho method, an iterating function f is used to de-ne a sequence (yi) by yi+1 = f(yi) for i = 0; 1; 2; : : :, with… (More)

Is this relevant?

1991

1991

- Eric Bach
- Inf. Comput.
- 1991

Pollard’s “rho” method for integer factorization iterates a simple polynomial map and produces a nontrivial divisor of n when two… (More)

Is this relevant?