Provable lattice reduction of \mathbb {Z}^n with blocksize n/2
From MaRDI portal
Publication:6489782
Recommendations
- On the lattice isomorphism problem
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem
- Analyzing blockwise lattice algorithms using dynamical systems
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
- A complete analysis of the BKZ lattice reduction algorithm
Cites work
- \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
- A canonical form for positive definite matrices
- A hierarchy of polynomial time lattice basis reduction algorithms
- Computing isometries of lattices
- Constructing integral lattices with prescribed minimum. I
- Factoring polynomials with rational coefficients
- Finding short lattice vectors within Mordell's inequality
- Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\)
- Hermite’s Constant and Lattice Algorithms
- scientific article; zbMATH DE number 2009972 (Why is no real title available?)
- Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice
- Lattice attacks on NTRU and LWE: a history of refinements
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- New directions in nearest neighbor searching with applications to lattice sieving
- On Lovász' lattice reduction and the nearest lattice point problem
- On the lattice isomorphism problem
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
- Revisiting the expected cost of solving uSVP and applications to LWE
- Slide reduction, revisited -- filling the gaps in SVP approximation
- Solving the shortest vector problem in 2ⁿ time using discrete Gaussian sampling (extended abstract)
Cited in
(6)- Hull attacks on the lattice isomorphism problem
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem
- Cryptanalysis of rank-2 module-LIP in totally real number fields
- Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding
- Dimension-reducing algorithms for quaternion ideal-SVP
- \textsf{HAWK}: having automorphisms weakens key
This page was built for publication: Provable lattice reduction of $$\mathbb {Z}^n$$ with blocksize n/2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6489782)
