Cryptology ePrint Archive: Report 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.

Category / Keywords: foundations / elliptic curve, ECDLP, prime numbers

Date: received 12 Mar 2007

Contact author: Grzegorz Wojtenko at wincor-nixdorf com

Available format(s): PDF | BibTeX Citation

Version: 20070322:141021 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]