jude/Riskless
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

missing .

Browse Source
This commit is contained in:
jude 2023-05-02 15:11:07 +01:00
parent 345d28e745
commit 003f1bc12c
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
whitepaper/Dissertation.tex
View File

@ -562,7 +562,7 @@ In the original Paillier scheme, ciphertexts are computed as $E(m, r) = c = g^m
\end{align*} \end{align*}
Jurik remarks that $E'(m, r) = E(m, h^r \bmod n)$. 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} \subsection{Private key}