An extension of Kannan's embedding for solving ring-based LWE problems
From MaRDI portal
Publication:2149793
DOI10.1007/978-3-030-92641-0_10zbMath1492.94151OpenAlexW4205163511MaRDI QIDQ2149793
Satoshi Nakamura, Masaya Yasuda
Publication date: 29 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-92641-0_10
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- On the concrete hardness of learning with errors
- Determinants of block tridiagonal matrices
- Factoring polynomials with rational coefficients
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Second order statistical behavior of LLL and BKZ
- Estimate all the {LWE, NTRU} schemes!
- On the success probability of solving unique SVP via BKZ
- Worst-case to average-case reductions for module lattices
- Revisiting the expected cost of solving uSVP and applications to LWE
- Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
- On error distributions in ring-based LWE
- On Ideal Lattices and Learning with Errors over Rings
- Lattice Enumeration Using Extreme Pruning
- Lattice-based Cryptography
- Efficient Public Key Encryption Based on Ideal Lattices
- Minkowski's Convex Body Theorem and Integer Programming
- A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge
- Lattice Attacks on NTRU and LWE: A History of Refinements
- Lattice Decoding Attacks on Binary LWE
- Hermite’s Constant and Lattice Algorithms
This page was built for publication: An extension of Kannan's embedding for solving ring-based LWE problems
