3 ms·
Presumably, God could foresee the cryptographic flaws of any algorithm, and could therefore design a simpler secure hash function than any human. In this case,
by p1mrx 6y ago
Presumably, God could foresee the cryptographic flaws of any algorithm, and could therefore design a simpler secure hash function than any human. In this case, "secure" means that there exists no algorithm to compute a preimage faster than brute force.
This would be a "nothing up my sleeve" function, in contrast to something like https://en.wikipedia.org/wiki/Dual_EC_DRBG https://en.wikipedia.org/wiki/Dual_EC_DRBG that cryptographers would identify as sketchy.
Hypothetical question: What is the Kolmogorov complexity of a secure 256-bit hash function?
- Y_Y 6y agoHence God must have computational power greater than a Turing machine, at least if he wants to prove His hash function minimises Kolmogorov complexity. For a rough upper bound, there are some examples at [0], which could be less than 100 characters of C (once golfed). [0] https://stackoverflow.com/a/14409947/5327391 https://stackoverflow.com/a/14409947/5327391