aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--final/rsa-method.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/final/rsa-method.tex b/final/rsa-method.tex
index af2c15a..69bf4b1 100644
--- a/final/rsa-method.tex
+++ b/final/rsa-method.tex
@@ -1,4 +1,4 @@
-The encryption process begins with the selection of two large primes, $p$ and $q$, their product $n=pq$, and a fourth number $e$ relatively prime to $\phi(n)$. $n$ is public, whereas $p$ and $q$ are secret.
+The encryption process begins with the selection of two large primes, $p$ and $q$, their product $n=pq$, and a fourth number $e$ relatively prime to $\phi(n)$. $n$ is public, whereas $p$ and $q$ are secret.\footnote{$^3$}{\link{https://primes.utm.edu/glossary/page.php?sort=RSA}}
\def\mod#1{\thinspace(mod\thinspace #1)}
\noindent Encryption is accomplished through the following three steps: