Finding dense submodules with algebraic lattice reduction
From MaRDI portal
Cites work
- A hierarchy of polynomial time lattice basis reduction algorithms
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- An LLL algorithm for module lattices
- An LLL algorithm with quadratic complexity
- BKZ 2.0: Better lattice security estimates
- Computing generator in cyclotomic integer rings. A subfield algorithm for the principal ideal problem in \(L_{|\varDelta_\mathbb {K}|}\left(\frac{1}{2}\right)\) and application to the cryptanalysis of a FHE scheme
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
- Factoring polynomials with rational coefficients
- Fast reduction of algebraic lattices over cyclotomic fields
- Finding dense submodules with algebraic lattice reduction
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 3760283 (Why is no real title available?)
- scientific article; zbMATH DE number 1962809 (Why is no real title available?)
- New NTRU Records with Improved Lattice Bases
- NTRU Fatigue: How Stretched is Overstretched?
- Random self-reducibility of ideal-SVP via Arakelov random walks
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Short bases of lattices over number fields
- Subexponential time relations in the class group of large degree number fields
- Worst-case to average-case reductions for module lattices
Cited in
(3)
This page was built for publication: Finding dense submodules with algebraic lattice reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030861)
