3 ms·
There exist crypto systems independent on P vs NP, both symmetric and asymnetric. The general approach exploits polynomial time complexity differences. However
by rrobukef 6y ago
There exist crypto systems independent on P vs NP, both symmetric and asymnetric. The general approach exploits polynomial time complexity differences. However key-sizes increase accordingly: last I saw a key-pair was a few 100's of megabytes. (an enourmous reduction from originally GB's)
- tgflynn 6y agoBut there aren't a lot of proven bounds on polynomial time complexity either. For all we know it may be possible to solve 3-SAT in linear time.