Cryptographic Hash Functions: A cryptographic hash function must have at least two security properties: collision free and Hiding. Collision free property ensures that for a given function H, no one can find x and y such that H(x) = H(y). The hid

Solve descrete log problem using meet in the middle attack. More formally, write a program to compute discrete log modulo a prime p. Let g be some element in Z p and suppose you are given h in Z p such that h = gx where 1 ≤ x ≤ 240. Your goal