fix typos
arnaucube git@arnaucube.com
Fri, 18 Sep 2026 07:21:56 +0200
2 files changed,
2 insertions(+),
2 deletions(-)
M
slides/slides_lattices-intro.tex
→
slides/slides_lattices-intro.tex
@@ -103,7 +103,7 @@ % - Lattices math
% - lattice hard problems are based on the hardness of finding short vectors. SVP, CVP, SIS, etc % TODO: why lattices are post quantum -% [done] Lattices are already used in browsers: explain how, hybrid signautres, etc +% [done] Lattices are already used in browsers: explain how, hybrid signatures, etc % clarify L^\perp notation, is it q-ary? \begin{frame}{Motivation}@@ -361,7 +361,7 @@
\begin{frame}{Lattice properties} a $n$-dimensional lattice $\Ll$ is \begin{enumerate}[i.] - \item \emph{additive subgroup} of $\Rr^n$: $\Ll$ is the nonempty subset of $\Rr^n$ closed under vector addition (and substraction),\\ + \item \emph{additive subgroup} of $\Rr^n$: $\Ll$ is the nonempty subset of $\Rr^n$ closed under vector addition (and subtraction),\\ $$\text{ie.}~ \forall x,y \in \Ll,~ -x, x+y \in \Ll$$ \item \emph{discrete}: every $x \in \Ll$ has a neighborhood in $\Rr^n$ in which $x$ is the only lattice point. \end{enumerate}