Question

Let g be a function which is collision resistant and maps arbitrary-length inputs to n − 1-bit outputs.

Consider the function h defined as below:

h(x) = 1 || x if x has bitlength n - 1 and,
h(x) = 0 || g(x) otherwise

Prove or disprove that h is a cryptographic hash function.

Answer 1

Answer:

y

Vhhhh good day of school and I have a great day of school and I have a great day of school and I have a great day of school and I have a great day of school and I have a great day of school and I have a great day of school and I have a great day of school and I have a great day of school and I have a great day of school and I have a great day of school and I have a great day of school and I have a great day

Explanation:

Dr appt at the end of school and I have a great day of school of school of school and I have a great day of school and I have a great day of school and I have a great day of school and I have a great day of school and I have a great day of school and I have a great day of school and I have a great day of school and I have a great day of school