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

Reorder sentences in 4d

Browse Source
This commit is contained in:
Tobias Eidelpes 2022-06-15 15:35:47 +02:00
parent d80aed71a9
commit d313f6e22e
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
exam/ex.tex
View File

@ -188,9 +188,9 @@
\item LEDAcrypt is based on the hardness of the decoding problem for linear \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 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 syndrome is $s=yH$. The best estimate for the received codeword is
$s=zH$. The best estimate for the received codeword is $x=y+z_0$. Finding $x=y+z_0$. Find a minimum-weight solution $z_0$ for the equation $s=zH$.
a minimum-weight solution to $s=zH$ given $s$ and $H$ is Finding a minimum-weight solution to $s=zH$ given $s$ and $H$ is
$\mathsf{NP}$-hard. $\mathsf{NP}$-hard.
\item \TODO \item \TODO