Consider an input data of the form X= (Xo, X, X2,....., Xn-1) where each X is...

Transcribed Image Text:

Consider an input data of the form X= (Xo, X₁, X2,....., Xn-1) where each X₁ is a byte. A suggested hash function is h(X) = Xo+ X₁ + X₂+.....+ Xn-1 where + stands for bitwise modulo two addition. Explain if h(X) is a secure hashing method. (6 marks) Demonstrate that the message authentication code, MAC defined by MACK(M) = h(K||M) where K is the symmetric key used, M is the plain text message and usual concatenation operator, results in an insecure MAC. Consider an input data of the form X= (Xo, X₁, X2,....., Xn-1) where each X₁ is a byte. A suggested hash function is h(X) = Xo+ X₁ + X₂+.....+ Xn-1 where + stands for bitwise modulo two addition. Explain if h(X) is a secure hashing method. (6 marks) Demonstrate that the message authentication code, MAC defined by MACK(M) = h(K||M) where K is the symmetric key used, M is the plain text message and usual concatenation operator, results in an insecure MAC.

Answer rating: 100% (QA)

Is hX a secure hashing method No hX is not a secure hashing method This is because it is very easy t... View the full answer