[Cryptography] Cuutilaimed generic attack on NP-complete problems

Sandy Harris sandyinchina at gmail.com
Sun Jul 5 09:32:44 EDT 2015


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?


More information about the cryptography mailing list