Question: 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 by (E).

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 by \(E\).

3. Multiply \(P\) and \(Q\) to get \(N\).

4. Calculate \(D=\frac{(P-1)(Q-1)(E-1)+1}{E}\)

Is this scheme equivalent to RSA? Show why or why not.

Step by Step Solution

3.36 Rating (152 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Cryptography And Network Security Questions!