On tiny-probability lattice enumeration

DOI10.1007/S13160-025-00713-6MaRDI QIDQ6888546zbMATH OpenFDO

Authors Yoshinori Aono, Phong Q. Nguyen

Publication date 8 December 2025

Published in Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1007/S13160-025-00713-6

zbMATH Keywords

extreme pruningGaussian heuristiclatticemodified cost prediction

Mathematics Subject Classification ID

Lattice points in specified regions (11P21) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07)

Cites work

• A sieve algorithm for the shortest lattice vector problem
• Additive combinatorics
• Algorithmic Number Theory
• BKZ 2.0: Better lattice security estimates
• Bounds on the lattice point enumerator via slices and projections
• How to Calculate Shortest Vectors in a Lattice
• scientific article; zbMATH DE number 1676629 (Why is no real title available?)
• scientific article; zbMATH DE number 3987367 (Why is no real title available?)
• scientific article; zbMATH DE number 1962809 (Why is no real title available?)
• Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Lattice enumeration using extreme pruning
• Lattice points in high-dimensional spheres
• Lower bounds on lattice enumeration with extreme pruning
• Monotonic optimization: Problems and solution approaches
• New directions in nearest neighbor searching with applications to lattice sieving
• On the Poisson distribution of lengths of lattice vectors in a random lattice
• Quantum lattice enumeration and tweaking discrete pruning
• Quantum lattice enumeration in limited depth
• Random sampling revisited: lattice enumeration with discrete pruning
• Shortest vector from lattice sieving: a few dimensions for free
• Sieve algorithms for the shortest vector problem are practical
• Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
• The Number of Lattice Points in a Set

This page was built for publication: On tiny-probability lattice enumeration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6888546)