This material may consist of step-by-step explanations on how to solve a problem or examples of proper writing, including the use of citations, references, bibliographies, and formatting. This material is made available for the sole purpose of studying and learning - misuse is strictly forbidden.Q1)
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....