Question

suppose that n secure cryptography hash function generate hash values that are n bits in length. explain how a brute force attack could be implemented what is the expected work factor?

​

Answer 1

Answer:

One-Way Hash Functions

A one-way hash function maps an arbitrary-length input message M to a fixed-length n-bit output digest H(M) such that the following properties hold:

One-way, or preimage resistant: Given a digest H(M), it is difficult to find the message M.

Second preimage resistant, or weakly collision resistant: Given a message M1, it is difficult to find another message M2 such that H(M1) = H(M2).

Collision resistant, or strongly collision resistant: It is difficult to find two messages M1 and M2 such that H(M1) = H(M2).

plz follow me I will follow you back plzplzplz