Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP

DOI10.1007/978-3-030-56880-1_8MaRDI QIDQ2096523zbMATH OpenOpenAlexFDO

Authors Tamalika Mukherjee, Noah Stephens-Davidowitz

Publication date 9 November 2022

Full work available at URL https://doi.org/10.1007/978-3-030-56880-1_8

zbMATH Keywords

lattice reduction algorithmsmodule lattices

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Recommendations

• Slide reduction, revisited -- filling the gaps in SVP approximation
• Fast reduction of algebraic lattices over cyclotomic fields
• Slide reduction, successive minima and several~applications
• An LLL algorithm for module lattices
• Improving convergence and practicality of slide-type reductions

Cites work

• A decade of lattice cryptography
• A generalization of the LLL-algorithm over Euclidean rings or orders
• An LLL algorithm for module lattices
• Approx-SVP in ideal lattices with pre-processing
• Complex Lattice Reduction Algorithm for Low-Complexity Full-Diversity MIMO Detection
• Efficient public key encryption based on ideal lattices (extended abstract)
• Factoring polynomials with rational coefficients
• Finding short lattice vectors within Mordell's inequality
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• scientific article; zbMATH DE number 6823399 (Why is no real title available?)
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP
• Lattice reductions over Euclidean rings with applications to cryptanalysis
• Making NTRU as secure as worst-case problems over ideal lattices
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• On Lovász' lattice reduction and the nearest lattice point problem
• On the shortness of vectors to be found by the ideal-SVP quantum algorithm
• Practical, Predictable Lattice Basis Reduction
• Pseudorandomness of ring-LWE for any ring and modulus
• Public-key cryptosystems from the worst-case shortest vector problem
• Recovering short generators of principal ideals in cyclotomic rings
• Ring-LWE in polynomial rings
• Short bases of lattices over number fields
• Short Stickelberger class relations and application to Ideal-SVP
• Slide reduction, revisited -- filling the gaps in SVP approximation
• The LLL algorithm. Survey and applications
• Theory of Cryptography
• Trapdoors for hard lattices and new cryptographic constructions
• Worst-case to average-case reductions for module lattices
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

Cited in

(7)

• Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP
• Application of automorphic forms to lattice problems
• Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice
• Reductions from module lattices to free module lattices, and application to dequantizing module-LLL
• Predicting module-lattice reduction
• Some upper bounds on dense module sublattices from number fields
• Refined modelling of the primal attack, and variants against Module-LWE

This page was built for publication: Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP

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