Exploring trade-offs in batch bounded distance decoding

DOI10.1007/978-3-030-38471-5_19MaRDI QIDQ778944zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

cryptanalysisLWElattice-based cryptographyNTRUBounded Distance Decodinghybrid attack

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cited in

(2)

• How to find ternary LWE keys using locality sensitive hashing
• Solving BDD by enumeration: an update

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)