LP Solutions of Vectorial Integer Subset Sums – Cryptanalysis of Galbraith’s Binary Matrix LWE
From MaRDI portal
Publication:5738780
DOI10.1007/978-3-662-54365-8_1zbMath1404.94081OpenAlexW2591365767MaRDI QIDQ5738780
Alexander May, Gottfried Herold
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-54365-8_1
Related Items (3)
Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes ⋮ A framework for practical anonymous credentials from lattices ⋮ Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
Uses Software
Cites Work
- Geometric algorithms and combinatorial optimization.
- On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack
- Provably Weak Instances of Ring-LWE Revisited
- Hardness of SIS and LWE with Small Parameters
- Key Homomorphic PRFs and Their Applications
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
- Provably Weak Instances of Ring-LWE
- On Ideal Lattices and Learning with Errors over Rings
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- A Toolkit for Ring-LWE Cryptography
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: LP Solutions of Vectorial Integer Subset Sums – Cryptanalysis of Galbraith’s Binary Matrix LWE
