On the LWE cryptosystem with more general disturbance
From MaRDI portal
Publication:6608568
DOI10.1007/978-981-99-2366-3_8MaRDI QIDQ6608568FDOQ6608568
Authors: Tian Kun 
Publication date: 20 September 2024
Cites Work
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- A sieve algorithm for the shortest lattice vector problem
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- On lattices, learning with errors, random linear codes, and cryptography
- Title not available (Why is that?)
- Lattice-based Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- Noise-tolerant learning, the parity problem, and the statistical query model
- On polynomial approximations to the shortest lattice vector length
- New lattice-based cryptographic constructions
- Multi-bit Cryptosystems Based on Lattice Problems
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Efficient fully homomorphic encryption from (standard) LWE
- Title not available (Why is that?)
- A central limit theorem for dependent random variables
- Public Key Cryptography – PKC 2004
- A cryptosystem based on a chameleon chaotic system and dynamic DNA coding
- Representing hard lattices with \(O(n\log n)\) bits (extended abstract)
This page was built for publication: On the LWE cryptosystem with more general disturbance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608568)
