Indiscreet discrete logarithms

Granger, Robert (2017) Indiscreet discrete logarithms Nieuw Archief voor Wiskunde, 5/18 (3). pp. 176-183.

Full text not available from this repository.

Abstract

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.

Item Type:	Article
Divisions :	Faculty of Engineering and Physical Sciences > Computing Science
Authors :	Name Email ORCID Granger, Robert r.granger@surrey.ac.uk
Date :	September 2017
Related URLs :	Publisher
Depositing User :	Clive Harris
Date Deposited :	06 Feb 2019 15:21
Last Modified :	06 Feb 2019 15:21
URI:	http://epubs.surrey.ac.uk/id/eprint/850387

Actions (login required)

View Item

Downloads