[Cryptography] Cuutilaimed generic attack on NP-complete problems

Andreas Gunnarsson list-cryptography at zzlevo.net
Sun Jul 5 17:23:08 EDT 2015

On Sun, Jul 05, 2015 at 09:32:44AM -0400, Sandy Harris wrote:
> Memcomputing NP-complete problems in polynomial time using polynomial
> resources and collective states
> http://advances.sciencemag.org/content/1/6/e1500031.full
> If this is real, what are the implications for crypto? For factoring?
> Discrete og?

Most likely not. Scott Aaronson pointed out the problem with this in his


More information about the cryptography mailing list