Discrete Logarithm Problem - from Gauß to Adleman and beyond

Date

Dec 7, 2016

Time

5:00 PM - 6:00 PM

Speaker

Dr. Jens Zumbrägel

Affiliation

TU Dresden, Institut für Algebra

Series

TUD Dresdner Mathematisches Seminar

Language

en

Main Topic

Mathematik

Other Topics

Mathematik

Host

Prof. Dr. R. Chill

Description

The discrete logarithm problem (DLP) is a famous number-theoretic computational problem with a long history. Its importance has been particularly boosted since the first asymmetric cryptosystem published by Diffie and Hellman is based on the hardness of the DLP. Today it remains, besides the integer factorisation problem, one of the standard problems for modern public-key cryptography. In this talk I will survey the advances in understanding the hardness of the DLP and highlight the underlying ideas from number theory and algebra. In particular, I will focus on the case of finite fields of small characteristic and outline the dramatic developments that occurred recently in this setting. Based on joint work with Faruk Göloğlu, Robert Granger, Thorsten Kleinjung and Gary McGuire.

Links

• Dresdner Mathematisches Seminar

Last modified: Nov 21, 2016, 4:25:37 PM