New discrete logarithm computation for the medium prime case using the function field sieve
Madhurima Mukhopadhyay, Palash Sarkar, Shashank Singh, Emmanuel Thomé · Advances in Mathematics of Communications · 2021
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.