3 ms·
The existence of one-way functions is one of those things that requires P≠NP. So all cryptographic hash functions would be broken.
by SAI_Peregrinus 9y ago
The existence of one-way functions is one of those things that requires P≠NP. So all cryptographic hash functions would be broken.
- justifier 9y agoI was thinking along the lines of a practical and novel solution to another problem built on top of the assumption p≠np But fair point, that is usually why I say such confidence in those technologies is disconcerting