Discrete Logarithm Factory - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Discrete Logarithm Factory

Abstract

The Number Field Sieve and its variants are the best algorithms to solve the discrete logarithm problem in finite fields. The Factory variant accelerates the computation when several prime fields are targeted. This article adapts the Factory variant to non-prime finite fields of medium and large characteristic. We combine this idea with two other variants of NFS, namely the tower and special variant. This combination leads to improvements in the asymptotic complexity. Besides, we lay out estimates of the practicality of this method for 1024-bit targets and extension degree 6.
Fichier principal
Vignette du fichier
Discrete_logarithm_factory.pdf (734.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Licence : CC BY - Attribution

Dates and versions

hal-04117298 , version 1 (05-06-2023)

Licence

Attribution

Identifiers

  • HAL Id : hal-04117298 , version 1

Cite

Haetham Al Aswad, Cécile Pierrot, Emmanuel Thomé. Discrete Logarithm Factory. 2023. ⟨hal-04117298⟩
42 View
7 Download

Share

Gmail Facebook Twitter LinkedIn More