Paper 2011/008

Computing Elliptic Curve Discrete Logarithms with the Negation Map

Ping Wang and Fangguo Zhang


It is clear that the negation map can be used to speed up the computation of elliptic curve discrete logarithms with the Pollard rho method. However, the random walks defined on elliptic curve points equivalence class $\{\pm P\}$ used by Pollard rho will always get trapped in fruitless cycles. We propose an efficient alternative approach to resolve fruitless cycles. Besides the theoretical analysis, we also examine the performance of the new algorithm in experiments with elliptic curve groups. The experiment results show that we can achieve the speedup by a factor extremely close to $\sqrt{2}$, which is the best performance one can achieve in theory, using the new algorithm with the negation map.

Available format(s)
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
elliptic curve cryptosystem
Contact author(s)
isszhfg @ mail sysu edu cn
2011-01-05: received
Short URL
Creative Commons Attribution


      author = {Ping Wang and Fangguo Zhang},
      title = {Computing Elliptic Curve Discrete Logarithms with the Negation Map},
      howpublished = {Cryptology ePrint Archive, Paper 2011/008},
      year = {2011},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.