Let $n$ be the modular arithmetic, $p$ and $q$ the two large primes such that $n=p*q$ and $e$ the public exponent. Here they are two "simple" numerical questions:
- If $p = 13$ and $q = 17$, what is the range for exponent e?
- Let be $p = 7$, $q = 11$ and $e = 3$. What is the max integer that can be encrypted?
About 1), I know that $e$ needs to be relatively prime to $φ(n)=(p-1)*(q-1)$, but how can I determine the range?
About 2), is there really a threshold on the maximum integer I can encrypt with RSA?