zenon/applied-cryptography
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Correctly solve 5m

Browse Source
This commit is contained in:
Tobias Eidelpes 2022-06-28 11:09:40 +02:00
parent 2dabc0a1a4
commit ca01edb6bb
1 changed files with 6 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
exam/ex.tex
View File

@ -407,11 +407,12 @@
finding an isomorphism for a specific commitment and challenge which finding an isomorphism for a specific commitment and challenge which
matches the response is hard. matches the response is hard.
\item The size of the signature comprises the commitment, which is a hash, \item The size of the signature comprises the commitment, which is a graph
and the response. The hash function is chosen to be $\unit[256]{bits}$ and of size $1107$, and the response. The commitment graph is encoded in
the response is $\lceil\log_2 1107\rceil\cdot 1107 = \unit[12.177]{kbit} = binary representation and requires $\binom{1107}{2} = \unit[612171]{bits}
\unit[1522.125]{bytes}$. In total, the signature is = \unit[76521.375]{bytes}$. The response is $\lceil\log_2 1107\rceil\cdot
$\unit[1554.125]{bytes}$ big. 1107 = \unit[12.177]{kbit} = \unit[1522.125]{bytes}$. In total, the
signature is $\unit[78043.5]{bytes}$ big.
\item The signature can be made smaller if the underlying graphs have less \item The signature can be made smaller if the underlying graphs have less
vertices. The signature shrinks linearly with the number of vertices. vertices. The signature shrinks linearly with the number of vertices.