Parallel Implementation of BDD Enumeration for LWE

DOI10.1007/978-3-319-39555-5_31zbMath1348.94061OpenAlexW2490028807MaRDI QIDQ2822698

Friedrich Wiemer, Alexander May, Elena Kirshanova

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

zbMATH Keywords

latticesbounded distance decoding\textsf{LWE} security

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Tightly secure ring-LWE based key encapsulation with short ciphertexts ⋮ On the asymptotic complexity of solving LWE ⋮ Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices

Uses Software

• NTL
• BKZ
• NTRU

Cites Work

• Unnamed Item
• On the concrete hardness of learning with errors
• On the complexity of the BKW algorithm on LWE
• On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack
• Hardness of SIS and LWE with Small Parameters
• Discrete Ziggurat: A Time-Memory Trade-Off for Sampling from a Gaussian Distribution over the Integers
• Decoding by Embedding: Correct Decoding Radius and DMT Optimality
• New Algorithms for Learning in Presence of Errors
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• BKZ 2.0: Better Lattice Security Estimates
• Coded-BKW: Solving LWE Using Lattice Codes
• An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
• Trapdoors for hard lattices and new cryptographic constructions
• Lattice Enumeration Using Extreme Pruning
• Minkowski's Convex Body Theorem and Integer Programming
• Solving BDD by Enumeration: An Update
• Lattice Decoding Attacks on Binary LWE
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Parallel Implementation of BDD Enumeration for LWE