Exploring trade-offs in batch bounded distance decoding

DOI10.1007/978-3-030-38471-5_19zbMATH Open1453.94057OpenAlexW2982550937MaRDI QIDQ778944FDOQ778944

Authors: Martin R. Albrecht, Benjamin R. Curtis, Thomas Wunderer 

Publication date: 21 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-38471-5_19

Recommendations

• Solving BDD by enumeration: an update
• Parallel implementation of \textsf{BDD} enumeration for \textsf{LWE}
• Lattice decoding attacks on binary LWE
• An improved BKW algorithm for LWE with applications to cryptography and lattices
• On Bounded Distance Decoding for General Lattices

zbMATH Keywords

cryptanalysisLWElattice-based cryptographyNTRUBounded Distance Decodinghybrid attack

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (1)

• How to find ternary LWE keys using locality sensitive hashing

This page was built for publication: Exploring trade-offs in batch bounded distance decoding

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