Skip to Main content Skip to Navigation

Display 

Licence


Distributed under a Creative Commons Attribution - NonCommercial - NoDerivatives 4.0 International License

Share

Metrics

Record views

704

Files downloads

46

Antoine Joux - Revisiting discrete logarithms in small/medium characteristic finite fields Journées Codage et Cryptographie 2014

2014-03-28

Description : In this talk, we present a new algorithm for the computation of discrete logarithms in finite fields of small characteristic. This algorithm combines several previously existing techniques with a few additional ingredients. Among those, the most notable is a new method for generating multiplicative relations with a "systematic side" by composing the polynomial (Xq-X) with homographies. This results in an algorithm of quasi-polynomial complexity for discrete logs in GF(qk) where k is close to q.


https://hal.archives-ouvertes.fr/medihal-01346252
Contributor : Fanny Bastien <>
Submitted on : Monday, July 18, 2016 - 3:37:04 PM
Last modification on : Wednesday, November 4, 2020 - 2:56:16 PM