We survey recent work on the elliptic curve discrete logarithm problem. In particular we review index calculus algorithms using summation polynomials, and claims about their complexity
The main focus of this thesis is the so-called elliptic curve discrete logarithm problem. The statem...
In the last two decades, many computational problems arising in cryptography have been successfully ...
In 2004, an algorithm is introduced to solve the DLP for elliptic curves defined over a non prime fi...
International audienceWe survey recent work on the elliptic curve discrete logarithm problem. In par...
International audienceWe survey recent work on the elliptic curve discrete logarithm problem. In par...
The introduction of summation polynomials for elliptic curves by Semaev has opened up new avenues of...
grantor: University of TorontoThe discrete logarithm problem has been the basis of numerou...
grantor: University of TorontoThe discrete logarithm problem has been the basis of numerou...
The discrete logarithm problem, and its adaptation to elliptic curves, called the elliptic curve dis...
Essentially all subexponential time algorithms for the discrete logarithm problem over finite fields...
In recent years several papers have appeared investigating the classical discrete logarithm problem ...
International audienceA survey on algorithms for computing discrete logarithms in Jacobians of curve...
International audienceA survey on algorithms for computing discrete logarithms in Jacobians of curve...
In 2008 and 2009, Gaudry and Diem proposed an index calculus method for the resolution of the discre...
The main focus of this thesis is the so-called elliptic curve discrete logarithm problem. The statem...
The main focus of this thesis is the so-called elliptic curve discrete logarithm problem. The statem...
In the last two decades, many computational problems arising in cryptography have been successfully ...
In 2004, an algorithm is introduced to solve the DLP for elliptic curves defined over a non prime fi...
International audienceWe survey recent work on the elliptic curve discrete logarithm problem. In par...
International audienceWe survey recent work on the elliptic curve discrete logarithm problem. In par...
The introduction of summation polynomials for elliptic curves by Semaev has opened up new avenues of...
grantor: University of TorontoThe discrete logarithm problem has been the basis of numerou...
grantor: University of TorontoThe discrete logarithm problem has been the basis of numerou...
The discrete logarithm problem, and its adaptation to elliptic curves, called the elliptic curve dis...
Essentially all subexponential time algorithms for the discrete logarithm problem over finite fields...
In recent years several papers have appeared investigating the classical discrete logarithm problem ...
International audienceA survey on algorithms for computing discrete logarithms in Jacobians of curve...
International audienceA survey on algorithms for computing discrete logarithms in Jacobians of curve...
In 2008 and 2009, Gaudry and Diem proposed an index calculus method for the resolution of the discre...
The main focus of this thesis is the so-called elliptic curve discrete logarithm problem. The statem...
The main focus of this thesis is the so-called elliptic curve discrete logarithm problem. The statem...
In the last two decades, many computational problems arising in cryptography have been successfully ...
In 2004, an algorithm is introduced to solve the DLP for elliptic curves defined over a non prime fi...
Add to ORKG