Consider the code in Problem 36, which is susceptible to a linearization attack. Suppose that we modify the program so that it computes a random delay within each iteration of the loop.
a. This program is still susceptible to a linearization attack. Why?
b. An attack on this modified program would be more difficult than an attack on the code that appears in Problem 36. Why?
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here