3 ms·Provided, of course, that P != NP.by rw 18y agoProvided, of course, that P != NP.tptacek 18y agoMessage digest functions are not, generally, number-theoretic.cperciva 18y agoHow is this relevant? The question of P ?= NP isn't limited to number-theoretic functions -- if P = NP then it is possible to find a preimage to any (polynomial time) hash function in polynomial time.tptacek 18y agoYou're right.