|Name:||Attacks on Small Characteristic Finite Fields for Discrete Logarithm Cryptography|
|Time:||Monday, June 23, 2014
05:20 pm - 05:40 pm
CCL - Congress Center Leipzig
|Speaker:||Jens Zumbrägel, TU Dresden|
|Abstract:||The Discrete Logarithm Problem (DLP) is one of the famous number-theoretic problems that are applied in contemporary cryptographic systems. This computational problem has been studied
for over a century and is of immense importance since the introduction of Public-Key Cryptography and the Diffie-Hellman protocol in 1976.
After a period for more than 20 years of very little algorithmic progress in this area, the DLP in finite fields of small characteristic underwent a dramatic development since 2013. These
improved algorithms have a strong impact, in particular on the security assumptions of some well known identity-based cryptosystems.
In this presentation I will illustrate how the new methods have been applied for some recent significant cryptanalysis record computations. The attacks demonstrate that some cryptosystems designed to be industry-standard secure can be broken in practice.