Understand the following problem scenarios and draw their structural diagrams. a) It is possible to use a hash function but no encryption for message authentication. The technique assumes that the two communicating parties (A and B) share a common secret value S (Salt). A computes the hash value over the concatenation of M and S and appends the resulting hash value to M. Because B possesses, it can recomputed the hash value to verify. Because the secret value itself is not sent, an adversary cannot modify an intercepted message and cannot generate a false message. B) Only the hash code is encrypted, using symmetric encryption. This reduces the processing burden for those applications that do not requ
Question 1. Understand the following problem scenarios and draw their structural diagrams.
a) It is possible to use a hash function but no encryption for message authentication. The technique assumes that the two communicating parties (A and B) share a common secret value S (Salt). A computes the hash value over the concatenation of M and S and appends the resulting hash value to M. Because B possesses, it can recomputed the hash value to verify. Because the secret value itself is not sent, an adversary cannot modify an intercepted message and cannot generate a false message.
B) Only the hash code is encrypted, using symmetric encryption. This reduces the processing burden for those applications that do not require confidentiality.
Step by step
Solved in 2 steps with 2 images