News for hackers. Stuff that matters.
Re:NSA seeks to build quantum computer that could crack most... by scythe on Friday January 03, 2014 @02:56AM (#7004583)
Elliptic curve cryptography is logically equivalent to prime-factorization cryptography in a sense: both are special cases of the hidden subgroup problem. DLP is also a version of the hidden subgroup problem. Any variant of HSP can be broken by a quantum computer using a variant of Shor's algorithm.
Re:NSA seeks to build quantum computer that could crack most... by venomsnake on Friday January 03, 2014 @04:45AM (#7004756)
How broken is the question - NSA cracks 2048 keys we just double the key size and are safe for 3-4 more years, or making it so trivial it doesn't matter how big the key size is.