AbstractWe present a function field sieve method for discrete logarithms over finite fields. This method is an analog of the number field sieve method originally developed for factoring integers. It is asymptotically faster than the previously known algorithms when applied to finite fields Fpn, where p6⩽n
In this short paper, we propose a variant of the Number Field Sieve to compute discrete logarithms i...
Abstract. The year 2013 has seen several major complexity advances for the discrete logarithm proble...
International audienceThe Number Field Sieve (NFS) algorithm is the best known method to compute dis...
AbstractWe present a function field sieve method for discrete logarithms over finite fields. This me...
International audienceIn this paper, we describe improvements to the function field sieve (FFS) for...
We present two general number field sieve algorithms solving the discrete logarithm problem in finit...
We present two general number field sieve algorithms solving the discrete logarithm problem in finit...
We look at efficient methods for computing logarithms in finite fields of any type. To achieve this,...
International audienceIn this paper, we study several variations of the number field sieve to compu...
Many of today's cryptographic systems are based on the discrete logarithm problem, e.g. the Diffie-H...
Abstract. The Number Field Sieve (NFS) algorithm is the best known method to compute discrete logari...
We give estimates for the running-time of the function field sieve (FFS) to compute discrete logarit...
We give estimates for the running-time of the function field sieve (FFS) to compute discrete logarit...
We give estimates for the running-time of the function field sieve (FFS) to compute discrete logarit...
In this paper, we propose two variants of the Number Field Sieve (NFS) to compute discrete logarithm...
In this short paper, we propose a variant of the Number Field Sieve to compute discrete logarithms i...
Abstract. The year 2013 has seen several major complexity advances for the discrete logarithm proble...
International audienceThe Number Field Sieve (NFS) algorithm is the best known method to compute dis...
AbstractWe present a function field sieve method for discrete logarithms over finite fields. This me...
International audienceIn this paper, we describe improvements to the function field sieve (FFS) for...
We present two general number field sieve algorithms solving the discrete logarithm problem in finit...
We present two general number field sieve algorithms solving the discrete logarithm problem in finit...
We look at efficient methods for computing logarithms in finite fields of any type. To achieve this,...
International audienceIn this paper, we study several variations of the number field sieve to compu...
Many of today's cryptographic systems are based on the discrete logarithm problem, e.g. the Diffie-H...
Abstract. The Number Field Sieve (NFS) algorithm is the best known method to compute discrete logari...
We give estimates for the running-time of the function field sieve (FFS) to compute discrete logarit...
We give estimates for the running-time of the function field sieve (FFS) to compute discrete logarit...
We give estimates for the running-time of the function field sieve (FFS) to compute discrete logarit...
In this paper, we propose two variants of the Number Field Sieve (NFS) to compute discrete logarithm...
In this short paper, we propose a variant of the Number Field Sieve to compute discrete logarithms i...
Abstract. The year 2013 has seen several major complexity advances for the discrete logarithm proble...
International audienceThe Number Field Sieve (NFS) algorithm is the best known method to compute dis...
DOI
Add to ORKG