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

[Peter Gutmann]

Aram Perez <aramperez at mac.com> writes:

>A professor who created an algorithm that may overturn an orthodoxy of
>computer science has the field’s experts excited. The rest of the story:
>https://www.technologyreview.com/s/543511/claimed-breakthrough-slays-classic-computing-problem-encryption-could-be-next/

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.

Peter.