On the Correct Use of the Negation Map in the Pollard rho Method
From MaRDI portal
Publication:3084344
DOI10.1007/978-3-642-19379-8_8zbMath1248.94056MaRDI QIDQ3084344
Tanja Lange, Daniel J. Bernstein, Peter Schwabe
Publication date: 15 March 2011
Published in: Public Key Cryptography – PKC 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19379-8_8
94A60: Cryptography
14G50: Applications to coding theory and cryptography of arithmetic geometry
11Y05: Factorization
Related Items
Computing elliptic curve discrete logarithms with the negation map, Computational hardness of IFP and ECDLP, Index calculus in the trace zero variety, Recent progress on the elliptic curve discrete logarithm problem, Speeding up elliptic curve discrete logarithm computations with point halving, The complete cost of cofactor \(h=1\), Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm, On the heuristic of approximating polynomials over finite fields by random mappings