From d313f6e22e5f70efbf400f9732914667fa7cae2a Mon Sep 17 00:00:00 2001 From: Tobias Eidelpes Date: Wed, 15 Jun 2022 15:35:47 +0200 Subject: [PATCH] Reorder sentences in 4d --- exam/ex.tex | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/exam/ex.tex b/exam/ex.tex index 8e88781..ad85d18 100644 --- a/exam/ex.tex +++ b/exam/ex.tex @@ -188,9 +188,9 @@ \item LEDAcrypt is based on the hardness of the decoding problem for linear codes. Given a parity-check matrix $H$ and a received codeword $y$, the - syndrome is $s=yH$. Find a minimum-weight solution $z_0$ for the equation - $s=zH$. The best estimate for the received codeword is $x=y+z_0$. Finding - a minimum-weight solution to $s=zH$ given $s$ and $H$ is + syndrome is $s=yH$. The best estimate for the received codeword is + $x=y+z_0$. Find a minimum-weight solution $z_0$ for the equation $s=zH$. + Finding a minimum-weight solution to $s=zH$ given $s$ and $H$ is $\mathsf{NP}$-hard. \item \TODO