$\frac{-}{1}.$

Question $3$

The preimage resistant $($one$-$way property$)$ of hash functions means that:

For any given hash value $h,$ it is computationally infeasible to find $y$ such that $H(y)=h$

$H(x)$ is relatively easy to compute for any given $x$

It is computationally infeasible to find any pair $(x,y)$ such that $H(x)=H(y)$

Hash value must meet the standard tests for pseudorandomness

$\frac{-}{1.}$

Question $4$

Which statement is true about master key in a key distribution center approach?