Integer version of ring-LWE and its applications
From MaRDI portal
Publication:5216985
Recommendations
Cites work
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- (Leveled) fully homomorphic encryption without bootstrapping
- A new public-key cryptosystem via Mersenne numbers
- Classical hardness of learning with errors
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Generalized Compact Knapsacks Are Collision Resistant
- How (not) to instantiate ring-LWE
- Lattice-based Cryptography
- Making NTRU as secure as worst-case problems over ideal lattices
- Modern computer algebra
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the hardness of the Mersenne Low Hamming Ratio assumption
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Provably weak instances of Ring-LWE
- Public-key cryptosystems from the worst-case shortest vector problem
- Ring-LWE in polynomial rings
- Weak instances of PLWE
- Worst-case to average-case reductions for module lattices
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(5)- Key mismatch attack on ThreeBears, Frodo and Round5
- Ring-LWE: applications to cryptography and their efficient realization
- Large modulus ring-LWE \(\geq \) module-LWE
- Ring-based identity based encryption -- asymptotically shorter MPK and tighter security
- On the integer polynomial learning with errors problem
This page was built for publication: Integer version of ring-LWE and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5216985)