scientific article; zbMATH DE number 7829251

DOI10.4230/LIPICS.ITCS.2022.19arXiv2109.04025MaRDI QIDQ6126244

Author name not available (Why is that?)

Publication date: 9 April 2024

Full work available at URL: https://arxiv.org/abs/2109.04025

Title of this publication is not available (Why is that?)

zbMATH Keywords

latticesshortest vector problemlattice-based cryptographybounded distance decodingfine-grained complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_{p}\) norms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6126244)