On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack
From MaRDI portal
Publication:2814692
DOI10.1007/978-3-319-31517-1_2zbMath1345.94045OpenAlexW2463363166MaRDI QIDQ2814692
Florian Göpfert, Thomas Wunderer, Rachel Player, Johannes A. Buchmann
Publication date: 22 June 2016
Published in: Progress in Cryptology – AFRICACRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-31517-1_2
Related Items (max. 100)
How to meet ternary LWE keys ⋮ On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes ⋮ A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack ⋮ Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS ⋮ Hardness of (M)LWE with semi-uniform seeds ⋮ Reduced memory meet-in-the-middle attack against the NTRU private key ⋮ A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$ ⋮ Unnamed Item ⋮ LP Solutions of Vectorial Integer Subset Sums – Cryptanalysis of Galbraith’s Binary Matrix LWE ⋮ On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL ⋮ Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices ⋮ Verifiable single-server private information retrieval from LWE with binary errors ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification ⋮ Parallel Implementation of BDD Enumeration for LWE ⋮ Unnamed Item
This page was built for publication: On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack
