How (Not) to Instantiate Ring-LWE
From MaRDI portal
Publication:2827731
DOI10.1007/978-3-319-44618-9_22zbMath1421.94066OpenAlexW2514587965MaRDI QIDQ2827731
Publication date: 21 October 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-44618-9_22
Related Items (19)
SoK: how (not) to design and implement post-quantum cryptography ⋮ A trace map attack against special ring-LWE samples ⋮ Homomorphic Encryption Standard ⋮ Error analysis of weak poly-LWE instances ⋮ On the ring-LWE and polynomial-LWE problems ⋮ Non-commutative ring learning with errors from cyclic algebras ⋮ Algebraically structured LWE. Revisited ⋮ Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus ⋮ Stronger security and generic constructions for adaptor signatures ⋮ Post-quantum key exchange for the Internet and the open quantum safe project ⋮ Attacks on the Search RLWE Problem with Small Errors ⋮ Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges ⋮ (In)security of ring-LWE under partial key exposure ⋮ Integer Version of Ring-LWE and Its Applications ⋮ A Subfield Lattice Attack on Overstretched NTRU Assumptions ⋮ Algebraic Aspects of Solving Ring-LWE, Including Ring-Based Improvements in the Blum--Kalai--Wasserman Algorithm ⋮ Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency ⋮ Rounding in the rings ⋮ The Complexity of Public-Key Cryptography
Uses Software
Cites Work
- Weak Instances of PLWE
- Provably Weak Instances of Ring-LWE Revisited
- Practical Bootstrapping in Quasilinear Time
- A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Cryptography for the Internet
- Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling
- New Algorithms for Learning in Presence of Errors
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- Provably Weak Instances of Ring-LWE
- Lattice-based Cryptography
- A Toolkit for Ring-LWE Cryptography
- Public-key cryptosystems from the worst-case shortest vector problem
- A sieve algorithm for the shortest lattice vector problem
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- On Ideal Lattices and Learning with Errors over Rings
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
- Noise-tolerant learning, the parity problem, and the statistical query model
This page was built for publication: How (Not) to Instantiate Ring-LWE
