Rounding in the rings
From MaRDI portal
Publication:2096527
Recommendations
- On the hardness of learning with rounding over small modulus
- Learning with rounding, revisited. New reduction, properties and applications
- On the hardness of the computational ring-LWR problem and its applications
- Pseudorandomness of ring-LWE for any ring and modulus
- Large modulus ring-LWE \(\geq \) module-LWE
Cites work
- (In)security of ring-LWE under partial key exposure
- A decade of lattice cryptography
- A normal integral basis theorem
- A toolkit for ring-LWE cryptography
- Advances in cryptology -- EUROCRYPT 2012. 31st annual international conference on the theory and applications of cryptographic techniques, Cambridge, UK, April 15--19, 2012. Proceedings
- 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
- Algebraically structured LWE. Revisited
- An efficient and parallel Gaussian sampler for lattices
- Attacks on the Search RLWE Problem with Small Errors
- Building an efficient lattice gadget toolkit: Subgaussian sampling and more
- Classical hardness of learning with errors
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Gaussian sampling over the integers: efficient, generic, constant-time
- How (not) to instantiate ring-LWE
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Learning with rounding, revisited. New reduction, properties and applications
- Middle-product learning with rounding problem and its applications
- On error distributions in ring-based LWE
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the concrete hardness of learning with errors
- On the hardness of learning with rounding over small modulus
- On the hardness of the computational ring-LWR problem and its applications
- On the ring-LWE and polynomial-LWE problems
- Order-LWE and the hardness of ring-LWE with entropic secrets
- Provably weak instances of Ring-LWE
- Pseudorandom functions and lattices
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- Pseudorandomness of ring-LWE for any ring and modulus
- Public-key cryptosystems from the worst-case shortest vector problem
- Round5: compact and fast post-quantum public-key encryption
- Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
- Security amplification for the cascade of arbitrarily weak PRPs. Tight bounds via the interactive hardcore lemma
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Weak instances of PLWE
Cited in
(16)- On the hardness of the computational ring-LWR problem and its applications
- A nonstandard variant of learning with rounding with polynomial modulus and unbounded samples
- On the hardness of learning with rounding over small modulus
- Learning with rounding, revisited. New reduction, properties and applications
- Pseudorandomness of ring-LWE for any ring and modulus
- RINGS AROUND SIERPINSKI HOLES
- Efficient lattice-based inner-product functional encryption
- A lower bound for proving hardness of learning with rounding with polynomial modulus
- Hardness of (M)LWE with semi-uniform seeds
- Hardness of entropic module-LWE
- Ring/module learning with errors under linear leakage -- hardness and applications
- Discrete Gaussians modulo sub-lattices: new leftover hash lemmas for discrete Gaussians
- Algebraic equipage for learning with errors in cyclic division algebras
- Revisiting the robustness of (R/M)LWR under polynomial moduli with its applications
- Pseudorandom correlation functions from Ring-LWR
- Leftover hash lemma(s) over cyclotomic rings
This page was built for publication: Rounding in the rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096527)
