scientific article; zbMATH DE number 3908520
From MaRDI portal
Publication:3686780
Recommendations
Cited in
(22)- Improvements in closest point search based on dual HKZ-bases
- An Algorithm to Compute the Nearest Point in the Lattice $A_{n}^*$
- On the security of OSIDH
- The Generalized Basis Reduction Algorithm
- Efficient algorithms for discrete lattice calculations
- Trapdoors for ideal lattices with applications
- Reductions between short vector problems and simultaneous approximation
- An efficient algorithm for clustered integer least squares problems.
- On the asymptotic complexity of solving LWE
- Note on shortest and nearest lattice vectors
- A parametric version of LLL and some consequences: parametric shortest and closest vector problems
- Nearest lattice point algorithms on semi k-reduced basis
- On finite-precision representations of geometric objects
- On the probability of generating a primitive matrix
- scientific article; zbMATH DE number 1445397 (Why is no real title available?)
- scientific article; zbMATH DE number 4045845 (Why is no real title available?)
- scientific article; zbMATH DE number 3870586 (Why is no real title available?)
- scientific article; zbMATH DE number 4132270 (Why is no real title available?)
- Finding well approximating lattices for a finite set of points
- scientific article; zbMATH DE number 4047093 (Why is no real title available?)
- Block Reduced Lattice Bases and Successive Minima
- Closest point search in lattices
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686780)