Smoothing codes and lattices: systematic study and new bounds

DOI10.1109/TIT.2023.3276921MaRDI QIDQ6574864zbMATH OpenFDO

Authors Thomas Debris-Alazard, Léo Ducas, Nicolas Resch, Jean-Pierre Tillich

Publication date 19 July 2024

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

linear programming boundworst-case boundsmoothing bounds in parallel between lattices and codes

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05)

Cited in

(1)

• Reduction from sparse LPN to LPN, dual attack 3.0

This page was built for publication: Smoothing codes and lattices: systematic study and new bounds

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