International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: PRIME POINTS ON ELLIPTIC CURVES AND ITS IMPACT ON ECDLP

Authors:
Grzegorz Wojtenko
Download:
URL: http://eprint.iacr.org/2007/092
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2007-13374,
  title={PRIME POINTS ON ELLIPTIC CURVES AND ITS IMPACT ON ECDLP},
  booktitle={IACR Eprint archive},
  keywords={foundations / elliptic curve, ECDLP, prime numbers},
  url={http://eprint.iacr.org/2007/092},
  note={ Grzegorz.Wojtenko@wincor-nixdorf.com 13584 received 12 Mar 2007},
  author={Grzegorz Wojtenko},
  year=2007
}