Why RSA must make sure that $\gcd(e,\varphi(n)) = 1$ instead of $\gcd(e,n) = 1$?
20397
In RSA, why is it important to choose e so that it is coprime to φ(n)?
97890
$\{1,1\}=\{1\}$, origin of this convention
73391
Prove that if $\gcd(a,b)=1$, then $\gcd(a^2,b^2)=1$
101744
When to use RSA and when ElGamal asymmetric encryption
139707
How many RSA keys before a collision?
20574
Understanding the proof for $\gcd (F_n, F_{n+k}) = 1$ where $F_n$ is a Fermat number
105975
Given the OneIdentity attribute why is GCD[a] evaluated to GCD[a]?
5486
RSA: How Euler's Theorem is used?
112039
Is RSA encryption with a private key the same as signature generation?
144812
Common modulus attack on RSA when the 2 public exponents differ by a single bit
36611
Algorithms for solving the discrete logarithm $a^x \equiv b\pmod{n}$ when $\gcd(a,n) \neq 1$
151093
RSA with composite numbers
69279
If $\gcd(a,b)=1$ then, $\gcd(a^2,b^2)=1$
7091
If $\gcd(a,b)=1$, then $\gcd(a^n,b^n)=1$
58029
Why is a Diffie-Hellman key exchange required when RSA is already being used for key exchange in TLS?
96398
An integer $a \pmod m$ has inverse if and only if $\gcd(a,m)=1$?
29572
Proof that $2^n-1$ does not always generate primes when primes are plugged in for $n$?