For RSA, how do i calculate the secret exponent?
For RSA, how do i calculate the secret exponent? Given p and q the two primes, and phi=(p-1)(q-1), and the public exponent (0x10001), how do i get the secret exponent 'd' ? I've read that i have to do: d = e -1 mod phi using modular inversion and the euclidean equation but i cannot understand how the above formula maps to either the a -1 ≡ x mod m formula on the modular inversion wiki page, or how it maps to the euclidean GCD equation. Can someone help please, cheers You can use the extended Euclidean algorithm to solve for d in the congruence de = 1 mod phi(m) For RSA encryption, e is the