Cryptography

RSA

Euler’s Totient Function

$\varphi (n)$ counts the positive integers up to n that are relative prime to n

Euler’s Theorem

$$a^{\varphi (n)}\equiv 1\mathrm{mod}n\iff GCD(a,n)=1$$