Question
I am stuck at trying to compute the RSA private key d. P=11, Q=7, (n) = 60, and e = 13, I found the GCD:
I am stuck at trying to compute the RSA private key d.
P=11, Q=7, (n) = 60, and e = 13,
I found the GCD:
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)
But i stuck at using the extended Euclidean Algorithm to compute D.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Linked Data A Geographic Perspective
Authors: Glen Hart, Catherine Dolbear
1st Edition
1000218910, 9781000218916
