Chris Peikert

activity

20102022

most citedClassical Hardness of Learning with Errors

41 citations · 83 across the 6 of their papers we have counts for

collaborators

Showing 2020Show all

2 papers · 1 filter

cs.IT2020

Lattice (List) Decoding Near Minkowski's Inequality

Ethan Mook, Chris Peikert

Minkowski proved that any $n$ -dimensional lattice of unit determinant has a nonzero vector of Euclidean norm at most $n$ ; in fact, there are $2^{Ω (n)}$ such lattice vectors.…

cs.CC2020

Hardness of Bounded Distance Decoding on Lattices in $ℓ_{p}$ Norms

Huck Bennett, Chris Peikert

$ \newcommand{\Z}{\mathbb{Z}} \newcommand{\eps}{\varepsilon} \newcommand{\cc}[1]{\mathsf{#1}} \newcommand{\NP}{\cc{NP}} \newcommand{\problem}[1]{\mathrm{#1}} \newcommand{\BDD}{\pro…

Lattice (List) Decoding Near Minkowski's Inequality

Hardness of Bounded Distance Decoding on Lattices in ℓp​ Norms

Hardness of Bounded Distance Decoding on Lattices in $ℓ_{p}$ Norms