Lattice attacks on NTRU and LWE: a history of refinements
From MaRDI portal
Publication:5034404
Recommendations
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
- Lattice Reduction Algorithms: Theory and Practice
- An efficient lattice reduction using reuse technique blockwisely on NTRU
- Improvement of lattice-based cryptography using CRT
- scientific article; zbMATH DE number 6823399
Cited in
(16)- On the measurement and simulation of the BKZ behavior for \(q\)-ary lattices
- Development and analysis of massive parallelization of a lattice basis reduction algorithm
- An extension of Kannan's embedding for solving ring-based LWE problems
- Fast practical lattice reduction through iterated compression
- Finding short integer solutions when the modulus is small
- Improvement of lattice-based cryptography using CRT
- Too many hints -- when LLL breaks LWE
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Recursive lattice reduction
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
- Provable dual attacks on learning with errors
- \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
- Provable lattice reduction of $$\mathbb {Z}^n$$ with blocksize n/2
- New NTRU Records with Improved Lattice Bases
- NTWE: A Natural Combination of NTRU and LWE
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
This page was built for publication: Lattice attacks on NTRU and LWE: a history of refinements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5034404)
