Parallel implementation of \textsf{BDD} enumeration for \textsf{LWE}

DOI10.1007/978-3-319-39555-5_31zbMATH Open1348.94061OpenAlexW2490028807MaRDI QIDQ2822698FDOQ2822698

Authors: Elena Kirshanova, Alexander May, Friedrich Wiemer 

Publication date: 4 October 2016

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-39555-5_31

Recommendations

• Solving BDD by enumeration: an update
• Making the BKW algorithm practical for LWE
• An improved BKW algorithm for LWE with applications to cryptography and lattices
• Better algorithms for LWE and LWR
• On the asymptotic complexity of solving LWE

zbMATH Keywords

latticesbounded distance decoding\textsf{LWE} security

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• BKZ 2.0: Better lattice security estimates
• Title not available (Why is that?)
• On lattices, learning with errors, random linear codes, and cryptography
• Trapdoors for hard lattices and new cryptographic constructions
• Minkowski's Convex Body Theorem and Integer Programming
• On the complexity of the BKW algorithm on LWE
• New Algorithms for Learning in Presence of Errors
• Better key sizes (and attacks) for LWE-based encryption
• Lattice enumeration using extreme pruning
• Decoding by Embedding: Correct Decoding Radius and DMT Optimality
• Discrete Ziggurat: a time-memory trade-off for sampling from a Gaussian distribution over the integers
• On the concrete hardness of learning with errors
• An improved BKW algorithm for LWE with applications to cryptography and lattices
• Hardness of SIS and LWE with small parameters
• Coded-BKW: solving LWE using lattice codes
• Solving BDD by enumeration: an update
• Lattice decoding attacks on binary LWE
• On the hardness of LWE with binary error: revisiting the hybrid lattice-reduction and meet-in-the-middle attack

Cited In (9)

• Solving LWR via BDD Strategy: Modulus Switching Approach
• Nearest planes in practice
• Title not available (Why is that?)
• On the asymptotic complexity of solving LWE
• Parallelizable delegation from LWE
• Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
• Tightly secure ring-LWE based key encapsulation with short ciphertexts
• Exploring trade-offs in batch bounded distance decoding
• Solving BDD by enumeration: an update

Uses Software

• NTL
• BKZ
• NTRU

This page was built for publication: Parallel implementation of \textsf{BDD} enumeration for \textsf{LWE}

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