Cryptography, Cybersecurity, Number Theory, Information Security, Rsa.
a short bit string H, ie. Hash(D) = H, where: Computation of the hash function on D should run on linear time or faster. Inversion of the hash function should be hard. More specifically, given H, it should be computationally hard to find D such that H = Hash(D). Here “computationally hard” means