A trace map attack against special ring-LWE samples
From MaRDI portal
Publication:2128748
DOI10.1007/978-3-030-85987-9_1zbMath1496.94051OpenAlexW3197499901MaRDI QIDQ2128748
Yasuhiko Ikematsu, Satoshi Nakamura, Masaya Yasuda
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-85987-9_1
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- On the concrete hardness of learning with errors
- On the hardness of module-LWE with binary secret
- 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!
- Algebraically structured LWE. Revisited
- A refined analysis of the cost for solving LWE via uSVP
- Worst-case to average-case reductions for module lattices
- Large modulus ring-LWE \(\geq \) module-LWE
- Revisiting the expected cost of solving uSVP and applications to LWE
- How (Not) to Instantiate Ring-LWE
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- BKZ 2.0: Better Lattice Security Estimates
- On the Efficacy of Solving LWE by Reduction to Unique-SVP
- On Ideal Lattices and Learning with Errors over Rings
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Lattice-based Cryptography
- Minkowski's Convex Body Theorem and Integer Programming
- A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge
- Hermite’s Constant and Lattice Algorithms
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Predicting Lattice Reduction
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: A trace map attack against special ring-LWE samples
