In RSA, what happens if the plaintext $m$ is not coprime to $n$?
15225
Does RSA work for any message M?
49136
How to compute $m$ value from RSA if $phi(n)$ is not relative prime with the $e$?
67059
Can we decrypt in this order when the message is encrypted twice?
83585
Why is a known-plaintext attack considered a complete break?
43152
Why do we use Φ while calculating the encryption key in RSA method?
89172
Why are these techniques not feasible to crack RSA?
44290
How can I use asymmetric encryption, such as RSA, to encrypt an arbitrary length of plaintext?
114519
An elementary question regarding a multiplicative character over finite fields
120813
Why are RSA key sizes almost always a power of two?
93803
What security authorities and standards reject $e=3$ in RSA, when, and with what rationale?
70064
Computational complexity of RSA
144812
Common modulus attack on RSA when the 2 public exponents differ by a single bit
103938
Why RSA uses {d,n} as private key instead of {e,n}?
40642
Using same modulus for RSA
51740
Factors of RSA modulus
26873
Is it possible to validate a Public Key in RSA?
65376
How common are weak RSA keys?