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

Add solution for 1c

Browse Source
This commit is contained in:
Tobias Eidelpes 2022-06-14 13:49:54 +02:00
parent f519a12152
commit 8ade466e3e
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

@ -122,7 +122,12 @@
(without the counter) is at most 102 bits long which gives a maximum (without the counter) is at most 102 bits long which gives a maximum
message length of $102\cdot (2^{26}-2) = \unit[6845103924]{bits}$. message length of $102\cdot (2^{26}-2) = \unit[6845103924]{bits}$.
\item \TODO \item $\widetilde{E}$ should behave like a pseudorandom permutation in order
to be able to prove the security of $\mathsf{CrAp}$. If it does not, a
distinguisher is able to gain a significant advantage because the block
cipher does not actually generate \emph{random} outputs. Further, if the
security of the underlying primitive is broken, the whole scheme falls
apart.
\item \TODO \item \TODO