In this problem, you will examine why techniques that work nicely for error correction codes are not suited as cryptographic hash functions. You will look at a hash function that computes an 8- bit hash value by applying the following equation:
Ci = bi1 (+) bi2 (+) bi3 (+) bi4 (+) bi5 (+) bi6 (+) bi7 (+) bi8 where (+) = xor
The Word CRYPTO hashes in: 111010
1. “Break” the hash function by pointing out how it is possible to find (meaningful) character strings which result in the same hash value. Provide an appropriate example showing your work; that is, show how your string’s hash matches that of CRYPTO.
2. Which crucial property of hash functions is missing in this case?
Here i am providing the answer. Hope it helps. please give me a like. it helps me a lot.
a. In the given question the hash value is generated after EXORing all the bits in the input values. For example, suppose we have the input as 10101011,11111000,00000111 and 11101010,10101010,01010101 will have the same hashed value.
b. The crucial property of the hash functions are that the hashed value is unique and irreversible. But in this case we might end up getting the same hash values for 2 different inputs. Here the unique hash value for every input is the property missing in the above hash function
Thank you. please upvote.
In this problem, you will examine why techniques that work nicely for error correction codes are...
In this problem, we will examine why techniques that work nicely for error correction codes are not suited as cryptographic hash functions. We look at a hash function that computes an 8-bit hash value by applying the following equation: Ci = bi1⊕bi2⊕bi3⊕bi4⊕bi5⊕bi6⊕bi7⊕bi8 Every block of 8 bits constitutes an ASCII-encoded character. 1. “Break” the hash function by pointing out how it is possible to find (meaningful) character strings which result in the same hash value. Provide an appropriate example. 2....