4 ms·
I don't think this is necessarily true. The gap between tractable and intractable is a human convention (albeit a reasonable one). It's quite possible that po
by baddox 16y ago
I don't think this is necessarily true. The gap between tractable and intractable is a human convention (albeit a reasonable one). It's quite possible that polynomial-time algorithms exist that technically defeat cryptography, but they can still be practically intractable if their constant factors are astronomical.
Of course, that's still a blow to cryptography, since polynomial increases in computing power will make cryptography-breaking algorithms run meaningfully faster. Still, I don't think it would immediately devastate cryptography.