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

Add solution for 1g

Browse Source
This commit is contained in:
Tobias Eidelpes 2022-06-14 11:48:02 +02:00
parent 640a0fe9de
commit 0f66d8ec3e
1 changed files with 6 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
exam/ex.tex
View File

@ -75,7 +75,12 @@
\item EWCDM is based on a pseudorandom permutation (i.e. block cipher) and
an almost xor-universal (AXU) hash function (one-way function).
\item \TODO
\item Yes, the authors delivered a security proof. The proof assumes that
the encryption function $E$ is a secure pseudorandom permutation for the
case of a nonce-misusing adversary. This requirement on the security of
$E$ is not present if the adversary is nonce-respecting. Additionally, the
distinguisher is computationally unbounded and never repeats a query.
\item \TODO
\item \TODO
\item \TODO