Question: I need to solve for the private key exponent d of this RSA key pair, using the extended Euclidean algorithm and linear algorithm , given

I need to solve for the private key exponent d of this RSA key pair, using the extended Euclidean algorithm and linear algorithm, given this number: (n) = 60, and e = 13.

I know the GCD this:

60 13 = 4 R 8 (60 = 4 13 + 8)

13 8 = 1 R 5 (13 = 1 8 + 5)

8 5 = 1 R 3 (8 = 1 5 + 3)

5 3 = 1 R 2 (5 = 1 3 + 2)

3 2 = 1 R 1 (3 = 1 2 + 1)

2 1 = 2 R 0 (2 = 2 1 + 0)

Step by Step Solution

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 Databases Questions!