On the Use of the Negation Map in the Pollard Rho Method

DOI10.1007/978-3-642-14518-6_9zbMath1260.11080OpenAlexW1881382661MaRDI QIDQ4931641

Thorsten Kleinjung, Arjen K. Lenstra, Joppe W. Bos

Publication date: 29 September 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://infoscience.epfl.ch/record/164553

zbMATH Keywords

negation mapPollard's rho methodfruitless cycles

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (5)

A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity ⋮ Speeding up elliptic curve discrete logarithm computations with point halving ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Computing elliptic curve discrete logarithms with the negation map ⋮ On the heuristic of approximating polynomials over finite fields by random mappings

This page was built for publication: On the Use of the Negation Map in the Pollard Rho Method