On error distributions in ring-based LWE
From MaRDI portal
Publication:2971006
DOI10.1112/S1461157016000280zbMath1404.94048MaRDI QIDQ2971006
Ilia Iliashenko, Frederik Vercauteren, Wouter Castryck
Publication date: 4 April 2017
Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)
Related Items (8)
Homomorphic Encryption Standard ⋮ An extension of Kannan's embedding for solving ring-based LWE problems ⋮ On the ring-LWE and polynomial-LWE problems ⋮ Algebraically structured LWE. Revisited ⋮ Security considerations for Galois non-dual RLWE families ⋮ Attacks on the Search RLWE Problem with Small Errors ⋮ A framework for cryptographic problems from linear algebra ⋮ Rounding in the rings
Uses Software
Cites Work
- Unnamed Item
- Weak Instances of PLWE
- Provably Weak Instances of Ring-LWE Revisited
- (Leveled) fully homomorphic encryption without bootstrapping
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Public-key cryptosystems from the worst-case shortest vector problem
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: On error distributions in ring-based LWE