Sieve algorithms for some orthogonal integer lattices

DOI10.1142/s1793830922501518OpenAlexW4293213651MaRDI QIDQ6059067

Unnamed Author, Celestin Nkuimi-Jugnia, Emmanuel Fouotsa

Publication date: 2 November 2023

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830922501518

zbMATH Keywords

sievinglatticesshortest vector probleminteger latticeorthogonal latticeLLL lattice basis reduction

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Minima of forms (11H50) Relations with coding theory (11H71)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Shortest vector from lattice sieving: a few dimensions for free
• LWE with side information: attacks and concrete security estimation
• On the shortness of vectors to be found by the ideal-SVP quantum algorithm
• On the complexity of computing short linearly independent vectors and short bases in a lattice
• Sieve algorithms for the shortest vector problem are practical
• Minkowski's Convex Body Theorem and Integer Programming
• On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• An Algorithmic Reduction Theory for Binary Codes: LLL and More
• Computing an LLL-reduced Basis of the Orthogonal Latice
• A sieve algorithm for the shortest lattice vector problem
• Deciding Orthogonality in Construction-A Lattices

This page was built for publication: Sieve algorithms for some orthogonal integer lattices