Let's consider a system where for security parametern, running for109∗n3clock cycles can break an encryption scheme with probability16∗n10∗2−n. Ifn=64, this probability is 1 (magic!) for109∗n3=109∗643clock cycles, requiring a running timeTof about three days on a1Ghzcomputer. Now a more powerful8Ghzcomputer becomes available. Butnis also doubled to 128 in the encryption scheme as well. Using the same running timeTas before on the new computer, what is the probability for this system to break this current encryption scheme? Please clearly show how you arrive at the conclusion. (Hint: First find out how much computation can be done in the given time on the new computer. Then you can see how that relates to the success probability.). Please type answer no write by hend.
Let's consider a system where for security parametern, running for109∗n3clock cycles can break an encryption scheme with probability16∗n10∗2−n. Ifn=64, this
Please type answer no write by hend.
Step by step
Solved in 3 steps
