From 11bcdff0a83835fa447c42e55477c2d5953e256b Mon Sep 17 00:00:00 2001
From: Tobias Eidelpes <tobias@eidelpes.info>
Date: Tue, 14 Jun 2022 16:25:51 +0200
Subject: [PATCH] Add solution for 2f

---
 exam/ex.tex | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/exam/ex.tex b/exam/ex.tex
index fe92231..0742647 100644
--- a/exam/ex.tex
+++ b/exam/ex.tex
@@ -133,7 +133,9 @@
 
     \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