Can you solve this problem?

Question 5 only Question 5 only.

Network security

4. Design a variant of Lamport's hash using k times more storage at the server but 1/k as much processing, on average, at the client. 5 Suppose we are using Lamport's hash, and Bob crashes before receiving Alice's reph pose an intruder, Trudy, can eavesdrop and detect that Bob crashed (maybe Trudy can cause Bob to crash). Then Trudy has a quantity (whatever Alice replied that Bob didre receive) which Trudy can use to impersonate Alice, if 'Trudy logs in before Alice attempeu log into Bob again. How can we modify Bob's behavior to prevent this threat? (Exactly do we overwrite Bob's database, and with what)? 6. With PDM, show how someone impersonating Alice or Bob can do a dictionary attac choose a Diffie-Hellman exponent, x, small enough that 2