New Discrete Logarithm Computation for the Medium Prime Case Using the Function Field Sieve - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Advances in Mathematics of Communications Year : 2020

New Discrete Logarithm Computation for the Medium Prime Case Using the Function Field Sieve

Abstract

The present work reports progress in discrete logarithm computation for the general medium prime case using the function field sieve algorithm. A new record discrete logarithm computation over a 1051-bit field having a 22-bit characteristic was performed. This computation builds on and implements previously known techniques. Analysis indicates that the relation collection and descent steps are within reach for fields with 32-bit characteristic and moderate extension degrees. It is the linear algebra step which will dominate the computation time for any discrete logarithm computation over such fields.
Fichier principal
Vignette du fichier
2020-113.pdf (311.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02964002 , version 1 (12-10-2020)

Identifiers

Cite

Madhurima Mukhopadhyay, Palash Sarkar, Shashank Singh, Emmanuel Thomé. New Discrete Logarithm Computation for the Medium Prime Case Using the Function Field Sieve. Advances in Mathematics of Communications, In press, ⟨10.3934/amc.2020119⟩. ⟨hal-02964002⟩
83 View
88 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More