Generalized Jacobian and Discrete Logarithm Problem on Elliptic Curves
Authors
Abstract:
Let E be an elliptic curve over the finite field F_{q}, P a point in E(F_{q}) of order n, and Q a point in the group generated by P. The discrete logarithm problem on E is to find the number k such that Q = kP. In this paper we reduce the discrete logarithm problem on E[n] to the discrete logarithm on the group F*_{q} , the multiplicative group of nonzero elements of Fq, in the case where n | q &minus 1, using generalized jacobian of E.
similar resources
Summation polynomials and the discrete logarithm problem on elliptic curves
The aim of the paper is the construction of the index calculus algorithm for the discrete logarithm problem on elliptic curves. The construction presented here is based on the problem of finding bounded solutions to some explicit modular multivariate polynomial equations. These equations arise from the elliptic curve summation polynomials introduced here and may be computed easily. Roughly spea...
full textOn the discrete logarithm problem for prime-field elliptic curves
In recent years several papers have appeared investigating the classical discrete logarithm problem for elliptic curves by means of the multivariate polynomial approach based on the celebrated summation polynomials, introduced by Semaev in 2004. However, with a notable exception by Petit et al. in 2016, all numerous papers have investigated only the composite-field case, leaving apart the labor...
full textNew algorithm for the discrete logarithm problem on elliptic curves
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 4. Extensive experimental data which supports the assu...
full textOn the discrete logarithm problem in elliptic curves II
We continue our study on the elliptic curve discrete logarithm problem over finite extension fields. We show, among other results, the following two results: For sequences of prime powers (qi)i∈N and natural numbers (ni)i∈N with ni −→ ∞ and ni log(qi) −→ 0 for i −→ ∞, the discrete logarithm problem in the groups of rational points of elliptic curves over the fields Fqi i can be solved in subexp...
full textOn the discrete logarithm problem in elliptic curves
We study the elliptic curve discrete logarithm problem over finite extension fields. We show that for any sequences of prime powers (qi)i∈N and natural numbers (ni)i∈N with ni −→ ∞ and ni log(qi) −→ 0 for i −→ ∞, the elliptic curve discrete logarithm problem restricted to curves over the fields Fqi i can be solved in subexponential expected time (qi i ) . We also show that there exists a sequen...
full textA Discrete Logarithm Attack on Elliptic Curves
We give an improved index calculus attack for a large class of elliptic curves. Our algorithm works by efficiently transferring the group structure of an elliptic curve to a weaker group. The running time of our attack poses a significant and realistic threat to the security of the elliptic curves in this class. As a consequence of our construction, we will also derive entirely new point counti...
full textMy Resources
Journal title
volume 4 issue None
pages 55- 64
publication date 2009-11
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023