Definition1.1RSA Encryption System
Given two primes \(p\) and \(q\) we encipher a message \(M\) using the RSA Encryption System by calculating \begin{equation*} C\equiv M^e \pmod{n} \end{equation*} where \(n=p\cdot q\) and \(e\) is the public enciphering key which must be relatively prime to \(\phi(n)\text{.}\)