Question: 2. (20 points). Suppose we have a cryptographic protocol Pn that is implemented using an? CPU instructions, where a is some positive constant. We expect

2. (20 points). Suppose we have a cryptographic protocol Pn that is implemented using an? CPU instructions, where a is some positive constant. We expect the protocol to be broken with B2n/10 CPU instructions. Suppose, today, everyone in the world uses the primitive Pn using n = no, a constant value such that even if the entire computing resources of the world were put together for 8 years we cannot compute 32n0/10 CPU instructions. Assume Moore's law holds. That is, every two years, the amount of CPU instructions a CPU can run per second doubles. (a) (5 points) Assuming Moore's law, how much faster will be the CPUs 8 years into the future as compared to the CPUs now
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
