PRIME POINTS ON ELLIPTIC CURVES AND ITS IMPACT ON ECDLP

Grzegorz Wojtenko

Paper 2007/092

PRIME POINTS ON ELLIPTIC CURVES AND ITS IMPACT ON ECDLP

Grzegorz Wojtenko

Abstract

In this paper we present that some statistical properties of points on elliptic curve can be used to form new equivalence classes. This can have an impact on solving discrete logarithm (ECDLP) owing to the reduction of the number of points among which a logarithm is searched to points of particular features. It should lead to an improvement of the Pollard-rho algorithm.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Published elsewhere. Unknown where it was published
Keywords: elliptic curve ECDLP prime numbers
Contact author(s): Grzegorz Wojtenko @ wincor-nixdorf com
History: 2007-03-22: received
Short URL: https://ia.cr/2007/092
License: CC BY

BibTeX

@misc{cryptoeprint:2007/092,
      author = {Grzegorz Wojtenko},
      title = {{PRIME} {POINTS} {ON} {ELLIPTIC} {CURVES} {AND} {ITS} {IMPACT} {ON} {ECDLP}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2007/092},
      year = {2007},
      url = {https://eprint.iacr.org/2007/092}
}