We show how the discrete logarithm problem in some finite cyclic groups can easily be reduced to the discrete logarithm problem in a finite field. The cyclic groups that we consider are the set of points on a singular elliptic curve over a finite field, the set of points on a genus 0 curve over a finite field given by the Pell equation, and certain subgroups of the general linear group
International audienceA survey on algorithms for computing discrete logarithms in Jacobians of curve...
peer reviewedThese notes summarize some computations conducted around the Elliptic Curves Discrete L...
elliptic curves, cryptography © Copyright Hewlett-Packard Company 1997 In this short note we describ...
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...
Abstract. Let E be an elliptic curve over the finite field Fq, P a point in E(Fq) of order n, and Q ...
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...
Abstract — Huhnlein et al showed that for totally non-aximal imaginary quadratic orders, the discre...
Given a cyclic group (G, ·) of order m and a generator α ∈ G, the Discrete Logarithm Problem (DLP) a...
[[abstract]]In this master thesis, we talk about the discrete logarithm on an elliptic curve, and th...
A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields
A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields
International audienceA survey on algorithms for computing discrete logarithms in Jacobians of curve...
These notes summarize some computations conducted around the Elliptic Curves Discrete Logarithm Prob...
International audienceA survey on algorithms for computing discrete logarithms in Jacobians of curve...
peer reviewedThese notes summarize some computations conducted around the Elliptic Curves Discrete L...
elliptic curves, cryptography © Copyright Hewlett-Packard Company 1997 In this short note we describ...
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...
Abstract. Let E be an elliptic curve over the finite field Fq, P a point in E(Fq) of order n, and Q ...
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...
Abstract — Huhnlein et al showed that for totally non-aximal imaginary quadratic orders, the discre...
Given a cyclic group (G, ·) of order m and a generator α ∈ G, the Discrete Logarithm Problem (DLP) a...
[[abstract]]In this master thesis, we talk about the discrete logarithm on an elliptic curve, and th...
A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields
A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields
International audienceA survey on algorithms for computing discrete logarithms in Jacobians of curve...
These notes summarize some computations conducted around the Elliptic Curves Discrete Logarithm Prob...
International audienceA survey on algorithms for computing discrete logarithms in Jacobians of curve...
peer reviewedThese notes summarize some computations conducted around the Elliptic Curves Discrete L...
elliptic curves, cryptography © Copyright Hewlett-Packard Company 1997 In this short note we describ...