Provable lattice reduction of $$\mathbb {Z}^n$$ with blocksize n/2
From MaRDI portal
Publication:6489782
DOI10.1007/S10623-023-01320-7MaRDI QIDQ6489782
Publication date: 22 April 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Quadratic forms (reduction theory, extreme forms, etc.) (11H55) Automorphism groups of lattices (11H56)
Cites Work
- Unnamed Item
- Unnamed Item
- On Lovász' lattice reduction and the nearest lattice point problem
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Computing isometries of lattices
- Slide reduction, revisited -- filling the gaps in SVP approximation
- Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\)
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
- Revisiting the expected cost of solving uSVP and applications to LWE
- Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling
- Constructing integral lattices with prescribed minimum. I
- New directions in nearest neighbor searching with applications to lattice sieving
- Lattice Attacks on NTRU and LWE: A History of Refinements
- Hermite’s Constant and Lattice Algorithms
- On the Lattice Isomorphism Problem
- A canonical form for positive definite matrices
- Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice
- \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
This page was built for publication: Provable lattice reduction of $$\mathbb {Z}^n$$ with blocksize n/2
