RSA: Private key calculation with Extended Euclidean Algorithm
I'm a high school student writing a paper on RSA, and I'm doing an example with some very small prime numbers. I understand how the system works, but I can't for the life of me calculate the private key using the extended euclidean algorithm. Here's what I have done so far: I have chosen the prime numbers p=37 and q=89 and calculated N=3293 I have calculated (p-1)(q-1)=3168 I have chosen a number e so that e and 3168 are relatively prime. I'm checking this with the standard euclidean algorithm, and that works very well. My e=25 Now I just have to calculate the private key d, which should