Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

Asymmetric cryptographic algorithms

Name: Anonymous 2011-07-16 18:04

Is it possible for any of them to survive to P=NP, assuming that NP-complete O(2^N) problems collapse to at best O(N²)?

Name: Anonymous 2011-07-17 20:41

>>13
The ``no'' was for
Is it possible for any of them to survive to P=NP?
The rest was just a remark.

Newer Posts