Huanguo Zhang
Abstract
Elliptic curve cryptosystem bases on elliptic curve discrete logarithm problem(ECDLP). Except a special class of elliptic curves, algorithms for ECDLP take fully exponential time. Distributed version of Pollard's rho algorithm is the fastest general-purpose algorithm known for the ECDLP. An example is given to show how to solve ECDLP using this algorithm.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Elliptic curve cryptosystem bases on elliptic curve discrete logarithm problem(ECDLP). Except a special class of elliptic curves, algorithms for ECDLP take fully exponential time. Distributed version of Pollard's rho algorithm is the fastest general-purpose algorithm known for the ECDLP. An example is given to show how to solve ECDLP using this algorithm.
Key concepts: Hessian form of an elliptic curve, Schoof's algorithm, Elliptic curve point multiplication, Elliptic curve, Tripling-oriented Doche–Icart–Kohel curve, Supersingular elliptic curve, Computer science, Edwards curve