9.13 Consider the following scheme: 1. Pick an odd number, E. 2. Pick two prime numbers, P and Q, where (P 1)(Q 1) 1 is evenly divisible byE. 3. Multiply P and Q to get N. 4. Calculate D=((P-1)(Q-1)(E-1)+1)/ E Is this scheme equivalent to RSA? Show why or why not. | |
| View Solution | |
| << Back | Next >> |