Rounding in the rings
From MaRDI portal
Publication:2096527
DOI10.1007/978-3-030-56880-1_11zbMath1504.94167OpenAlexW3048748976MaRDI QIDQ2096527
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_11
Related Items
Efficient lattice-based inner-product functional encryption ⋮ Hardness of (M)LWE with semi-uniform seeds
Uses Software
Cites Work
- On the concrete hardness of learning with errors
- On the hardness of the computational ring-LWR problem and its applications
- On the ring-LWE and polynomial-LWE problems
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
- Gaussian sampling over the integers: efficient, generic, constant-time
- Advances in cryptology -- EUROCRYPT 2018. 37th annual international conference on the theory and applications of cryptographic techniques, Tel Aviv, Israel, April 29 -- May 3, 2018. Proceedings. Part I
- (In)security of ring-LWE under partial key exposure
- Algebraically structured LWE. Revisited
- Order-LWE and the hardness of ring-LWE with entropic secrets
- Middle-product learning with rounding problem and its applications
- Building an efficient lattice gadget toolkit: Subgaussian sampling and more
- Round5: compact and fast post-quantum public-key encryption
- Advances in cryptology -- EUROCRYPT 2012. 31st annual international conference on the theory and applications of cryptographic techniques, Cambridge, UK, April 15--19, 2012. Proceedings
- On the Hardness of Learning with Rounding over Small Modulus
- Weak Instances of PLWE
- A Decade of Lattice Cryptography
- Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
- How (Not) to Instantiate Ring-LWE
- Learning with Rounding, Revisited
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Pseudorandom Functions and Lattices
- On error distributions in ring-based LWE
- Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma
- Provably Weak Instances of Ring-LWE
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- An Efficient and Parallel Gaussian Sampler for Lattices
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Attacks on the Search RLWE Problem with Small Errors
- A Toolkit for Ring-LWE Cryptography
- Pseudorandomness of ring-LWE for any ring and modulus
- Public-key cryptosystems from the worst-case shortest vector problem
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
- A normal integral basis theorem
This page was built for publication: Rounding in the rings
