[Cryptography] Claimed Breakthrough Slays Classic Computing Problem; Encryption Could Be Next

[Viktor Dukhovni]

> On Apr 15, 2018, at 11:17 PM, Peter Gutmann <pgut001 at cs.auckland.ac.nz> wrote:
> 
> Let's wait for the third lecture, the publication of his paper(s), and the six
> to twelve months it usually takes for someone to either find the flaw in the
> proof or show that it can't be mapped onto the factoring problem in a manner
> more efficient than solving the factoring problem directly.

The data on the article is "November 13, 2015".  Babai's graph-isomorphism advance is a settled result (and was recognized correct in short order), but "encryption could be next" is simply hype.

-- 
	Viktor.