New algorithm for the discrete logarithm problem on elliptic curves
From MaRDI portal
Abstract: A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of Boolean equations. Under a first fall degree assumption the regularity degree of the system is at most . Extensive experimental data which supports the assumption is provided. An heuristic analysis suggests a new asymptotical complexity bound for computing discrete logarithms on an elliptic curve over a field of size . For several binary elliptic curves recommended by FIPS the new method performs better than Pollard's.
This page was built for publication: New algorithm for the discrete logarithm problem on elliptic curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6260598)
