Suppose h(m) is a collision-resistant hash function that maps a message of arbitrary bit length into an n-bit hash value. is it
1 answer:
You might be interested in
Answer: -26
Explanation:
We have: 1 1 1 0 0 1 0 1
Since it’s one’s complement representation, then we check the very first digit to state if the number is negative or positive. Since the very first digit to the left is 1, then the number will be negative.
When it is negative, we now flip the bits, so that we get:
0 0 0 1 1 0 1 0
Notice we just turn the 1’s into 0’s and vice versa.
We now convert this binary into decimal:
We assign to each digit the corresponding power of 2.
See it in a table:
Then multiplying each digit by its corresponding power of 2 and then adding the results, we get:
We get:
Since we stated that the number is negative, then, the final result is: -26