From ae29e0a69c85d1efc2a13779ad959287acb40af0 Mon Sep 17 00:00:00 2001 From: Holden Rohrer Date: Mon, 11 Nov 2019 23:36:41 -0500 Subject: added citation --- final/rsa-method.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'final') 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: -- cgit