On the Efficacy of Solving LWE by Reduction to Unique-SVP
From MaRDI portal
Publication:3193270
DOI10.1007/978-3-319-12160-4_18zbMath1368.94082OpenAlexW2162903136MaRDI QIDQ3193270
Florian Göpfert, Martin R. Albrecht, Robert Fitzpatrick
Publication date: 16 October 2015
Published in: Information Security and Cryptology -- ICISC 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-12160-4_18
Related Items (17)
A trace map attack against special ring-LWE samples ⋮ Shortest vectors in lattices of Bai-Galbraith's embedding attack on the LWR problem ⋮ Homomorphic Encryption Standard ⋮ Solving the search-LWE problem over projected lattices ⋮ \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption ⋮ A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack ⋮ Estimation of the hardness of the learning with errors problem with a restricted number of samples ⋮ Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS ⋮ Revisiting the Sparsification Technique in Kannan’s Embedding Attack on LWE ⋮ Revisiting group oriented secret sharing schemes ⋮ On the (M)iNTRU assumption in the integer case ⋮ A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$ ⋮ An Experimental Study of Kannan’s Embedding Technique for the Search LWE Problem ⋮ On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL ⋮ Giophantus distinguishing attack is a low dimensional learning with errors problem ⋮ On the success probability of solving unique SVP via BKZ ⋮ Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency
Cites Work
- Unnamed Item
- New bounds in some transference theorems in the geometry of numbers
- New Algorithms for Learning in Presence of Errors
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- BKZ 2.0: Better Lattice Security Estimates
- Polly Cracker, Revisited
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice-based Cryptography
- Efficient Public Key Encryption Based on Ideal Lattices
- Minkowski's Convex Body Theorem and Integer Programming
- On the equidistribution of Hecke points
- Solving BDD by Enumeration: An Update
- Fully homomorphic encryption using ideal lattices
- Predicting Lattice Reduction
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: On the Efficacy of Solving LWE by Reduction to Unique-SVP
