Welcome to the resource topic for 2013/582
Title:
The Special Number Field Sieve in \F _{p^{n}}, Application to Pairing-Friendly Constructions
Authors: 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.
ePrint: https://eprint.iacr.org/2013/582
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .