RSA: If I know n, e, p, and q, how do I calculate d using the extended euclidean algorithm?
314
Calculating RSA private exponent when given public exponent and the modulus factors using extended euclid
141747
Difficulty of breaking RSA for a given key size
40101
Does Knowing Two Proper Factors of an RSA Public Key Permit Decryption if $N$ is Not a Semiprime?
23048
The ring $\mathbb Z[\sqrt{-2}]= \{a+b\sqrt{-2} ; a\in \mathbb Z,b\in \mathbb Z \}$ has a Euclidean algorithm
49136
How to compute $m$ value from RSA if $phi(n)$ is not relative prime with the $e$?
77211
How to calculate elliptic curve parameters?
91565
How to efficiently compute $\,25^{37}\pmod{55}$?
82988
Is RSA key size the size of private key exponent?
39969
Algorithms for computing multiplicative order modulo $n$
43926
RSA encryption with private key and decryption with a public key
71821
How do I derive the time complexity of encryption and decryption based on modular arithmetic?
2954
Extended Euclidean Algorithm in $GF(2^8)$?
100512
Is there a way to systematically calculate the public exponent $e$ in RSA?
138178
Proving the number of iterations in the Euclidean algorithm
154948
Decisional Diffie-Hellman: compute Legendre symbol of $g^{ab}$ from $g^a$ and $g^b$?
93803
What security authorities and standards reject $e=3$ in RSA, when, and with what rationale?
91929
How are these AES MixColumn multiplication tables calculated?