Web: http://arxiv.org/abs/2109.04025

Jan. 27, 2022, 2:20 a.m. | Huck Bennett, Chris Peikert, Yi Tang

cs.CR updates on arXiv.org arxiv.org

We show improved fine-grained hardness of two key lattice problems in the
$\ell_p$ norm: Bounded Distance Decoding to within an $\alpha$ factor of the
minimum distance ($\mathrm{BDD}_{p, \alpha}$) and the (decisional)
$\gamma$-approximate Shortest Vector Problem ($\mathrm{SVP}_{p,\gamma}$),
assuming variants of the Gap (Strong) Exponential Time Hypothesis (Gap-(S)ETH).
Specifically, we show:

1. For all $p \in [1, \infty)$, there is no $2^{o(n)}$-time algorithm for
$\mathrm{BDD}_{p, \alpha}$ for any constant $\alpha > \alpha_\mathsf{kn}$,
where $\alpha_\mathsf{kn} = 2^{-c_\mathsf{kn}} < 0.98491$ and $c_\mathsf{kn}$
is the …

eth under

More from arxiv.org / cs.CR updates on arXiv.org

Senior Incident Responder

@ CipherTechs, Inc. | Remote

Data Security DevOps Engineer Senior/Intermediate

@ University of Michigan - ITS | Ann Arbor, MI

Senior Penetration Tester

@ CipherTechs, Inc. | Remote

Data Analyst

@ SkyePoint Decisions | Washington, DC

POA&M Analyst

@ SkyePoint Decisions | Washington, DC

PKI Systems Engineer

@ SkyePoint Decisions | Springfield, VA