On the LWE cryptosystem with more general disturbance
From MaRDI portal
Publication:6608568
Recommendations
Cites work
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- scientific article; zbMATH DE number 2196508 (Why is no real title available?)
- A central limit theorem for dependent random variables
- A cryptosystem based on a chameleon chaotic system and dynamic DNA coding
- A sieve algorithm for the shortest lattice vector problem
- Efficient fully homomorphic encryption from (standard) LWE
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Lattice-based Cryptography
- Multi-bit Cryptosystems Based on Lattice Problems
- New lattice-based cryptographic constructions
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- On polynomial approximations to the shortest lattice vector length
- Public Key Cryptography – PKC 2004
- Public-key cryptosystems from the worst-case shortest vector problem
- 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)