Monthly Archives: June 2013

Razvan Barbulescu, Emmanuel Thomé and Antoine Joux

Taken at the workshop on number theory in Paris. The first public talks on the quasi-polyomial-time algorithm. — Steven Galbraith Advertisements

Image | Posted on by | 1 Comment

Quasi-polynomial-time algorithm for discrete logarithm in finite fields of small/medium characteristic

A major breakthrough this week has been the announcement by Razvan Barbulescu, Pierrick Gaudry, Antoine Joux and Emmanuel Thomé of a quasi-polynomial-time DLP algorithm for finite fields. The paper is available here The algorithm applies to finite fields of the … Continue reading

Posted in Uncategorized | 2 Comments

Eurocrypt 2013 and the Gödel Prize

EUROCRYPT 2013 was held in Athens last week. It was a very well-organised and enjoyable conference, with two papers directly related to elliptic curve research. Craig Costello presented his recent work with Joppe Bos, Huseyin Hisil, and Kristin Lauter on … Continue reading

Posted in Uncategorized | Leave a comment