RSA: Why must e be relative prime to phi(n)
20397
In RSA, why is it important to choose e so that it is coprime to φ(n)?
11781
Am I Doing RSA Correctly?
14827
RSA: Fast factorization of N if d and e are known
40642
Using same modulus for RSA
135417
RSA when N=pq and p = q
132830
What place do prime numbers have in cryptography?
17178
Order of $\phi(g)$ divides the order of $g$
29572
Proof that $2^n-1$ does not always generate primes when primes are plugged in for $n$?
49938
Proof of $a^{\phi (n) +1} \equiv a \pmod{\! n} $ Carmichael generalization of Fermat-Euler's theorem.
100512
Is there a way to systematically calculate the public exponent $e$ in RSA?
158213
RSA with probable primes
68376
How, if at all, does pure mathematics benefit from $2^{74207281}-1$ being prime?
60804
About the property of $m$: if $n < m$ is co-prime to $m$, then $n$ is prime
145375
RSA problem if i choose two specific small prime numbers?
50781
$(n+1)$th prime $p_{n+1}$ less than or equal to $p_1p_2\dots p_n+1$
95937
Why aren't all prime subfields equal to {0,1}?
133617
Relatively prime property verification