Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-02964002
Contributor : Emmanuel Thomé <>
Submitted on : Monday, October 12, 2020 - 9:38:22 AM
Last modification on : Wednesday, October 14, 2020 - 3:54:02 PM

File

2020-113.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02964002, version 1

Collections

Citation

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, AIMS, In press. ⟨hal-02964002⟩

Share

Metrics

Record views

12

Files downloads

19