Add solution for 2f
This commit is contained in:
parent
8ade466e3e
commit
11bcdff0a8
@ -133,7 +133,9 @@
|
|||||||
|
|
||||||
\item \TODO
|
\item \TODO
|
||||||
|
|
||||||
\item \TODO
|
\item The length of the random nonce $N$ is $\unit[96]{bits}$. The expected
|
||||||
|
number of evaluations an attacker has to make to obtain a repeated nonce
|
||||||
|
is $2^{96/2} = 2^{48}$.
|
||||||
|
|
||||||
\item \TODO
|
\item \TODO
|
||||||
|
|
||||||
|
|||||||
Loading…
x
Reference in New Issue
Block a user