Add to ORKGWe prove that the discrete logarithm problem can be solved in quasi-polynomial expected time in the multiplicative group of finite fields of fixed characteristic. More generally, we prove that it can be solved in the field of cardinality pn in expected time (pn)2log2(n)+O(1)
In this talk, we present a new algorithm for the computation of discrete logarithms in finite fields...
summary:We obtain lower bounds on degree and additive complexity of real polynomials approximating t...
Abstract. The year 2013 has seen several major complexity advances for the discrete logarithm proble...
We prove that the discrete logarithm problem can be solved in quasi-polynomial expected time in the ...
For q a prime power, the discrete logarithm problem (DLP) in Fq consists in finding, for any g ∈ F ×...
International audienceThe advent of a heuristic quasi-polynomial complexity algorithm in 2013 for so...
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...
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...
We show how the discrete logarithm problem in some finite cyclic groups can easily be reduced to the...
A new proof is given for the correctness of the powers of two descent method for computing discrete ...
Due to its use in cryptographic protocols such as the Diffie–Hellman key exchange, the discrete loga...
We give estimates for the running-time of the function field sieve (FFS) to compute discrete logarit...
grantor: University of TorontoThe discrete logarithm problem has been the basis of numerou...
In this talk, we present a new algorithm for the computation of discrete logarithms in finite fields...
summary:We obtain lower bounds on degree and additive complexity of real polynomials approximating t...
Abstract. The year 2013 has seen several major complexity advances for the discrete logarithm proble...
We prove that the discrete logarithm problem can be solved in quasi-polynomial expected time in the ...
For q a prime power, the discrete logarithm problem (DLP) in Fq consists in finding, for any g ∈ F ×...
International audienceThe advent of a heuristic quasi-polynomial complexity algorithm in 2013 for so...
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...
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...
We show how the discrete logarithm problem in some finite cyclic groups can easily be reduced to the...
A new proof is given for the correctness of the powers of two descent method for computing discrete ...
Due to its use in cryptographic protocols such as the Diffie–Hellman key exchange, the discrete loga...
We give estimates for the running-time of the function field sieve (FFS) to compute discrete logarit...
grantor: University of TorontoThe discrete logarithm problem has been the basis of numerou...
In this talk, we present a new algorithm for the computation of discrete logarithms in finite fields...
summary:We obtain lower bounds on degree and additive complexity of real polynomials approximating t...
Abstract. The year 2013 has seen several major complexity advances for the discrete logarithm proble...