Shortest vectors in lattices of Bai-Galbraith's embedding attack on the LWR problem
From MaRDI portal
Publication:2128750
DOI10.1007/978-3-030-85987-9_2OpenAlexW3197081079MaRDI QIDQ2128750
Shusaku Uemura, Kazuhide Fukushima, Shinsaku Kiyomoto, Tsuyoshi Takagi, Momonari Kudo
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-85987-9_2
lattice-based cryptographypost-quantum cryptographylearning with roundingBai-Galbraith's embedding attack
Uses Software
Cites Work
- On the concrete hardness of learning with errors
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- A refined analysis of the cost for solving LWE via uSVP
- Revisiting the expected cost of solving uSVP and applications to LWE
- Pseudorandom Functions and Lattices
- New Algorithms for Learning in Presence of Errors
- BKZ 2.0: Better Lattice Security Estimates
- On the Efficacy of Solving LWE by Reduction to Unique-SVP
- Minkowski's Convex Body Theorem and Integer Programming
- Lattice Decoding Attacks on Binary LWE
- Predicting Lattice Reduction
- On lattices, learning with errors, random linear codes, and cryptography
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
- Solving LWR via BDD Strategy: Modulus Switching Approach
This page was built for publication: Shortest vectors in lattices of Bai-Galbraith's embedding attack on the LWR problem
