Abstract — Huhnlein et al showed that for totally non-aximal imaginary quadratic orders, the discrete logarithm problem can be reduced to the discrete logarithm problem in some finite fields. In previous work we showed that for twisted anomalous elliptic curves, the logarithm problem can also be reduced to the logarithm problem in some finite fields. In this work we present an algorithm to construct this class of elliptic curves
International audienceIn 2008 and 2009, Gaudry and Diem proposed an index calculus method for the re...
These notes summarize some computations conducted around the Elliptic Curves Discrete Logarithm Prob...
We survey recent work on the elliptic curve discrete logarithm problem. In particular we review inde...
Since nobody can guarantee that the computation of discrete logarithms in elliptic curves or IF p...
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...
elliptic curves, cryptography © Copyright Hewlett-Packard Company 1997 In this short note we describ...
Abstract. Let E be an elliptic curve over the finite field Fq, P a point in E(Fq) of order n, and Q ...
[[abstract]]In this master thesis, we talk about the discrete logarithm on an elliptic curve, and th...
We show how the discrete logarithm problem in some finite cyclic groups can easily be reduced to the...
AbstractWe propose an index calculus algorithm for the discrete logarithm problem on general abelian...
The main focus of this thesis is the so-called elliptic curve discrete logarithm problem. The statem...
Essentially all subexponential time algorithms for the discrete logarithm problem over finite fields...
The main focus of this thesis is the so-called elliptic curve discrete logarithm problem. The statem...
In 2008 and 2009, Gaudry and Diem proposed an index calculus method for the resolution of the discre...
International audienceIn 2008 and 2009, Gaudry and Diem proposed an index calculus method for the re...
These notes summarize some computations conducted around the Elliptic Curves Discrete Logarithm Prob...
We survey recent work on the elliptic curve discrete logarithm problem. In particular we review inde...
Since nobody can guarantee that the computation of discrete logarithms in elliptic curves or IF p...
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...
elliptic curves, cryptography © Copyright Hewlett-Packard Company 1997 In this short note we describ...
Abstract. Let E be an elliptic curve over the finite field Fq, P a point in E(Fq) of order n, and Q ...
[[abstract]]In this master thesis, we talk about the discrete logarithm on an elliptic curve, and th...
We show how the discrete logarithm problem in some finite cyclic groups can easily be reduced to the...
AbstractWe propose an index calculus algorithm for the discrete logarithm problem on general abelian...
The main focus of this thesis is the so-called elliptic curve discrete logarithm problem. The statem...
Essentially all subexponential time algorithms for the discrete logarithm problem over finite fields...
The main focus of this thesis is the so-called elliptic curve discrete logarithm problem. The statem...
In 2008 and 2009, Gaudry and Diem proposed an index calculus method for the resolution of the discre...
International audienceIn 2008 and 2009, Gaudry and Diem proposed an index calculus method for the re...
These notes summarize some computations conducted around the Elliptic Curves Discrete Logarithm Prob...
We survey recent work on the elliptic curve discrete logarithm problem. In particular we review inde...
Add to ORKG