|
|
|
|
|
by alexkus
4445 days ago
|
|
You now know the two primes (p,q) which multiply together to make n (the public key modulus). We also know e (the public key exponent). d (the private key) is:- d = e^-1 mod ((p-1)(q-1))
To work this modular inverse out you use the extended Euclidean algorithm.This is why you need to know the factorisation of n=(p*q). You can't compute d (the private key) with just the composite n. |
|