Skip to Main content Skip to Navigation
Conference papers

The Tower Number Field Sieve

Abstract : 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 Joux and Pierrot. We present a new NFS variant for SNFS computations, which is better for some cryptographically relevant cases, according to a precise comparison of norm sizes. The new algorithm is an adaptation of Schirokauer's variant of NFS based on tower extensions, for which we give a middlebrow presentation.
Document type :
Conference papers
Complete list of metadata

Cited literature [36 references]  Display  Hide  Download
Contributor : Razvan Barbulescu Connect in order to contact the contributor
Submitted on : Wednesday, May 27, 2015 - 9:42:47 AM
Last modification on : Saturday, June 25, 2022 - 7:39:35 PM
Long-term archiving on: : Monday, April 24, 2017 - 3:25:57 PM


Files produced by the author(s)


  • HAL Id : hal-01155635, version 1


Razvan Barbulescu, Pierrick Gaudry, Thorsten Kleinjung. The Tower Number Field Sieve. ASIACRYPT 2015, International Association of Cryptologic Research, Nov 2015, Auckland, New Zealand. pp.31-58. ⟨hal-01155635⟩



Record views


Files downloads