Loading...
journal article
Indiscreet discrete logarithms
In 2013 and 2014 a revolution took place in the understanding of the discrete logarithm problem (DLP) in finite fields of small characteristic. Consequently, many cryptosystems based on cryptographic pairings were rendered completely insecure, which serves as a valuable reminder that long-studied so-called hard problems may turn out to be far easier than initially believed. In this article, Robert Granger gives an overview of the surprisingly simple ideas behind some of the breakthroughs and the many computational records that have so far resulted from them.
Loading...
Name
naw5-2017-18-3-176.pdf
Type
Publisher's version
Access type
openaccess
Size
204.58 KB
Format
Adobe PDF
Checksum (MD5)
f052f812433dd55861036aabcf37de47