The Special Number Field Sieve in $\F _{p^{n}}$, Application to Pairing-Friendly Constructions - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

The Special Number Field Sieve in $\F _{p^{n}}$, Application to Pairing-Friendly Constructions

Antoine Joux
Cécile Pierrot

Résumé

In this paper, we study the discrete logarithm problem in finite fields related to pairing-based curves. We start with a precise analysis of the state-of-the-art algorithms for computing discrete logarithms that are suitable for finite fields related to pairing-friendly constructions. To improve upon these algorithms, we extend the Special Number Field Sieve to compute discrete logarithms in $\F_{p^{n}}$, where $p$ has an adequate sparse representation. Our improved algorithm works for the whole range of applicability of the Number Field Sieve.
Fichier non déposé

Dates et versions

hal-01213666 , version 1 (08-10-2015)

Identifiants

Citer

Antoine Joux, Cécile Pierrot. The Special Number Field Sieve in $\F _{p^{n}}$, Application to Pairing-Friendly Constructions. 6th International Conference on Pairing-based Cryptography, Pairing 2013, Nov 2013, Beijing, China. pp.45-61, ⟨10.1007/978-3-319-04873-4_3⟩. ⟨hal-01213666⟩
75 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More