Integer Version of Ring-LWE and Its Applications
From MaRDI portal
Publication:5216985
DOI10.1007/978-981-15-0758-8_9zbMath1430.94072OpenAlexW2981977814MaRDI QIDQ5216985
Publication date: 20 February 2020
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-981-15-0758-8_9
Related Items
Key mismatch attack on ThreeBears, Frodo and Round5, On the integer polynomial learning with errors problem
Uses Software
Cites Work
- Unnamed Item
- A new public-key cryptosystem via Mersenne numbers
- On the hardness of the Mersenne Low Hamming Ratio assumption
- Worst-case to average-case reductions for module lattices
- Weak Instances of PLWE
- (Leveled) fully homomorphic encryption without bootstrapping
- How (Not) to Instantiate Ring-LWE
- Modern Computer Algebra
- Ring-LWE in Polynomial Rings
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Provably Weak Instances of Ring-LWE
- On Ideal Lattices and Learning with Errors over Rings
- Generalized Compact Knapsacks Are Collision Resistant
- Lattice-based Cryptography
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Public-key cryptosystems from the worst-case shortest vector problem
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- 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
