#### Filter Results:

#### Publication Year

2012

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. Phong Q. HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from… (More)

The difficulty of computing discrete logarithms in fields F q k depends on the relative sizes of k and q. Until recently all the cases had a sub-exponential complexity of type L(1/3), similar to the factorization problem. In 2013, Joux designed a new algorithm with a complexity of L(1/4 + ǫ) in small characteristic. In the same spirit, we propose in this… (More)

- Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé +2 others
- 2013

The year 2013 has seen several major complexity advances for the discrete logarithm problem in multiplicative groups of small-characteristic finite fields. These outmatch, asymptotically, the Function Field Sieve (FFS) approach, which was so far the most efficient algorithm known for this task. Yet, on the practical side, it is not clear whether the new… (More)

In this paper, we study the discrete logarithm problem in medium and high characteristic finite fields. We propose a variant of the Number Field Sieve (NFS) based on numerous number fields. Our improved algorithm computes discrete logarithms in F p n for the whole range of applicability of NFS and lowers the asymptotic complexity from L p n (1/3, (128/9)… (More)

The aim of this work is to investigate the hardness of the discrete logarithm problem in fields GF(p n) where n is a small integer greater than 1. Though less studied than the small characteristic case or the prime field case, the difficulty of this problem is at the heart of security evaluations for torus-based and pairing-based cryptography. The best… (More)

The security of pairing-based crypto-systems relies on the difficulty to compute discrete logarithms in finite fields Fpn where n is a small integer larger than 1. The state-of-art algorithm is the number field sieve (NFS) together with its many variants. When p has a special form (SNFS), as in many pairings constructions, NFS has a faster variant due to… (More)

This note can be seen as an appendix of a recent paper of Kim [Kim15]. We show that the discrete logarithm problem in fields FQ where Q = p n with p of medium size and n having a factor of the good size (specified in the article) has a complexity of LQ(1/3, 3 48/9). We propose here a variant of NFS which combines exTNFS with the Conjugation method of… (More)

The Function Field Sieve (FFS) algorithm is dedicated to computing discrete logarithms in a finite field F q n , where q is a prime power, small compared to q n. Introduced by Adleman in [Adl94] and inspired by the Number Field Sieve (NFS), the algorithm collects pairs of polynomials (a, b) ∈ F q [t] such that the norms of a − bx in two function fields are… (More)

In this paper we prove some divisibility properties of the cardinal-ity of elliptic curves modulo primes. These proofs explain the good behavior of certain parameters when using Montgomery or Edwards curves in the setting of the elliptic curve method (ECM) for integer factorization. The ideas of the proofs help us to find new families of elliptic curves… (More)