New Algorithms for the Discrete Logarithm Problem in Finite Fields of Small Characteristic (1/3)

Datum

20.05.2014

Zeit

16:40 - 18:10

Sprecher

Dr. Jens Zumbrägel

Zugehörigkeit

TU Dresden, Institut für Algebra

Sprache

en

Hauptthema

Mathematik

Andere Themen

Mathematik

Host

Prof. Dr. R. Schilling / Dipl.-Math J. Hollender

Beschreibung

Ein Vortrag im Rahmen der "Graduate Lectures in Mathematics" The Discrete Logarithm Problem (DLP) has been a long-studied problem in number theory. Its importance has raised in particular since the introduction of Public-Key Cryptography and the Diffie-Hellman protocol in 1976, which relies on the hardness of the DLP. After very little algorithmic progress for more than 20 years, the DLP in finite fields of small characteristic underwent a dramatic development since 2013. At the heart of the new methods is the usage of higher splitting probabilities of certain polynomials over finite fields. These improved algorithms have a strong impact, e.g., on the security assumptions of some well known identity-based cryptosystems. This lecture series provides an overview of the history and the recent developments of DLP algorithms. We will discuss the mathematics behind the new algorithms as well as implementational aspects that lead to some recent significant record computations.

Links

• Webseite der Graduate Lectures in Mathematics

Letztmalig verändert: 08.04.2014, 17:51:22