CompNetwork 38
- A
Given hash y, it should be computationally infeasible to find x such that y = h(x).
- B
Given hash y and a message x such that y = h(x), it should be computationally infeasible to find x'≠ x such that h(x') = h(x) = y.
- C
Given hash y, it should be easy to find x such that y = h(x).
- D
It should be computationally infeasible to find x', x such that h(x') = h(x)
Accessibility
Oversized Widget
Saved in this browser. Nothing changes for anyone else.