Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation - Archive ouverte HAL Access content directly
Conference Papers Year : 2021

Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation

(1) , (1) , (1)
1

Abstract

The Tower variant of the Number Field Sieve (TNFS) is known to be asymptotically the most efficient algorithm to solve the discrete logarithm problem in finite fields of medium characteristics, when the extension degree is composite. A major obstacle to an efficient implementation of TNFS is the collection of algebraic relations, as it happens in dimension greater than 2. This requires the construction of new sieving algorithms which remain efficient as the dimension grows. In this article, we overcome this difficulty by considering a lattice enumeration algorithm which we adapt to this specific context. We also consider a new sieving area, a high-dimensional sphere, whereas previous sieving algorithms for the classical NFS considered an orthotope. Our new sieving technique leads to a much smaller running time, despite the larger dimension of the search space, and even when considering a larger target, as demonstrated by a record computation we performed in a 521-bit finite field GF(p^6). The target finite field is of the same form than finite fields used in recent zero-knowledge proofs in some blockchains. This is the first reported implementation of TNFS.
Fichier principal
Vignette du fichier
paper.pdf (532.37 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03242324 , version 1 (31-05-2021)
hal-03242324 , version 2 (06-01-2022)

Identifiers

Cite

Gabrielle de Micheli, Pierrick Gaudry, Cécile Pierrot. Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation. ASIACRYPT 2021 - 27th Annual International Conference on the Theory and Application of Cryptology and Information Security, Dec 2021, Virtual, Singapore. pp.67-96, ⟨10.1007/978-3-030-92062-3_3⟩. ⟨hal-03242324v2⟩
121 View
121 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More