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

Add solution for 5k

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

8
exam/ex.tex
View File

@ -380,7 +380,13 @@
Futhermore, the commitment is also not vulnerable to dictionary attacks,
as is common with stored password hashes on the server's side.
\item \TODO
\item If the function generating the isomorphisms keeps the same $k=36$
first vertices, the security degrades considerably. Under normal
circumstances, the number of possible isomorphisms is $1107!$. If the
first $36$ vertices are always kept the same, the domain shrinks to
$(1107-36)!=1071!$. While the difference might not seem to be practically
relevant, the security degrades factorially with every further reduction
in graph size.
\item The signer calculates a commitment with a predefined soundness error.
Then the signer calculates the challenge by taking the hash of the message