Add to ORKGInternational audienceThe advent of a heuristic quasi-polynomial complexity algorithm in 2013 for solving the discrete logarithm problem over small characteristic finite fields has had the consequence that this problem can no longer be considered as being sufficiently hard for cryptographic needs. We will describe the idea of the algorithm, its more recent modifications, and consider directions for extensions to other contexts
Computing discrete logarithms is a long-standing algorithmic problem, whose hardness forms the basis...
Computing discrete logarithms is a long-standing algorithmic problem, whose hardness forms the basis...
This paper reports on the computation of a discrete logarithm in the finite field $\mathbb F_{2^3075...
International audienceThe advent of a heuristic quasi-polynomial complexity algorithm in 2013 for so...
Due to its use in cryptographic protocols such as the Diffie–Hellman key exchange, the discrete loga...
Due to its use in cryptographic protocols such as the Diffie–Hellman key exchange, the discrete loga...
Due to its use in cryptographic protocols such as the Diffie–Hellman key exchange, the discrete loga...
In the recent breakthrough paper by Barbulescu, Gaudry, Joux and Thomé, a quasi-polynomial time algo...
In the recent breakthrough paper by Barbulescu, Gaudry, Joux and Thomé, a quasi-polynomial time algo...
Given a group G and two elements g,h ∈ G, solving the discrete logarithm problem consists of finding...
In this talk, we present a new algorithm for the computation of discrete logarithms in finite fields...
Recently, several striking advances have taken place regarding the discrete logarithm problem (DLP) ...
Wan and Jincheng Zhuang In the recent breakthrough paper by Barbulescu, Gaudry, Joux and Thomé, a q...
The discrete logarithm problem is one of the few hard problems on which public-key cryptography can ...
International audienceIn the present work, we present a new discrete logarithm algorithm, in the sam...
Computing discrete logarithms is a long-standing algorithmic problem, whose hardness forms the basis...
Computing discrete logarithms is a long-standing algorithmic problem, whose hardness forms the basis...
This paper reports on the computation of a discrete logarithm in the finite field $\mathbb F_{2^3075...
International audienceThe advent of a heuristic quasi-polynomial complexity algorithm in 2013 for so...
Due to its use in cryptographic protocols such as the Diffie–Hellman key exchange, the discrete loga...
Due to its use in cryptographic protocols such as the Diffie–Hellman key exchange, the discrete loga...
Due to its use in cryptographic protocols such as the Diffie–Hellman key exchange, the discrete loga...
In the recent breakthrough paper by Barbulescu, Gaudry, Joux and Thomé, a quasi-polynomial time algo...
In the recent breakthrough paper by Barbulescu, Gaudry, Joux and Thomé, a quasi-polynomial time algo...
Given a group G and two elements g,h ∈ G, solving the discrete logarithm problem consists of finding...
In this talk, we present a new algorithm for the computation of discrete logarithms in finite fields...
Recently, several striking advances have taken place regarding the discrete logarithm problem (DLP) ...
Wan and Jincheng Zhuang In the recent breakthrough paper by Barbulescu, Gaudry, Joux and Thomé, a q...
The discrete logarithm problem is one of the few hard problems on which public-key cryptography can ...
International audienceIn the present work, we present a new discrete logarithm algorithm, in the sam...
Computing discrete logarithms is a long-standing algorithmic problem, whose hardness forms the basis...
Computing discrete logarithms is a long-standing algorithmic problem, whose hardness forms the basis...
This paper reports on the computation of a discrete logarithm in the finite field $\mathbb F_{2^3075...