diff --git a/whitepaper/Dissertation.tex b/whitepaper/Dissertation.tex
index c87503d..1f39dff 100644
--- a/whitepaper/Dissertation.tex
+++ b/whitepaper/Dissertation.tex
@@ -562,7 +562,7 @@ In the original Paillier scheme, ciphertexts are computed as $E(m, r) = c = g^m
 \end{align*}
 Jurik remarks that $E'(m, r) = E(m, h^r \bmod n)$.
 
-The main speedup as a result of using Jurik's form originates from fixed base exponentiation, as discussed in \hyperref[subsection:modexp]{Section~\ref*{subsection:modexp}}
+The main speedup as a result of using Jurik's form originates from fixed base exponentiation, as discussed in \hyperref[subsection:modexp]{Section~\ref*{subsection:modexp}}.
 
 \subsection{Private key}