4 ms·
> Assume P != NP for hashes to work. Why? Isn't brute forcing non-broken cryptographic hash function EXPTIME complexity class? (relative to output size bits
by nabla9 5y ago
> Assume P != NP for hashes to work.
Why?
Isn't brute forcing non-broken cryptographic hash function EXPTIME complexity class? (relative to output size bits).
Even if P=NP cryptographic hashes should work just fine.
- porton 5y agoBecause for my proof to work I need polynomial-time hashing.