The Special Number Field Sieve in $\F _{p^{n}}$, Application to Pairing-Friendly Constructions - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

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

Antoine Joux
Cécile Pierrot

Abstract

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.
No file

Dates and versions

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

Identifiers

Cite

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⟩
76 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More