Hash Functions & El Gamal Signature Scheme

See Question.pdf

• Question.pdf

Q1)
a)
According the definition, the function h(x) is preimage resistant if given an output y it is infeasible to find the input, namely x such that αx= y. On the other hand, together with the fact that α is primitive root mod p, we obtain the definition of the discrete logarithm problem (which is known as NP-Hard problem for a prime p chosen with length 1024 bits). Hence the chosen hash function is preimage resistant....

This is only a preview of the solution. Please use the purchase button to see the entire solution