Speeding up Pollard's rho method for computing discrete logarithms
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 541-554
- https://doi.org/10.1007/bfb0054891
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Use of Elliptic Curves in CryptographyPublished by Springer Nature ,2000
- A space efficient algorithm for group structure computationMathematics of Computation, 1998
- Random walks supported on random points ofZ/nZProbability Theory and Related Fields, 1994
- Elliptic Curve CryptosystemsMathematics of Computation, 1987
- A Course in Number Theory and CryptographyPublished by Springer Nature ,1987
- The Arithmetic of Elliptic CurvesPublished by Springer Nature ,1986
- A Monte Carlo Factoring Algorithm With Linear StorageMathematics of Computation, 1984
- An improved Monte Carlo factorization algorithmBIT Numerical Mathematics, 1980
- Monte Carlo Methods for Index Computation (mod p)Mathematics of Computation, 1978
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978