An LLL algorithm for module lattices

DOI10.1007/978-3-030-34621-8_3MaRDI QIDQ2176639zbMATH OpenOpenAlexFDO

Authors C.-M. Lee, Alice Pellet-Mary, Damien Stehlé, Alexandre Wallet

Publication date 5 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-34621-8_3

zbMATH Keywords

closest vector problem oraclecryptographic designGauss' algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• A modification of the LLL reduction algorithm
• An LLL algorithm with quadratic complexity
• An algorithm for finding a shortest vector in a two-dimensional modular lattice
• A hierarchy of polynomial time lattice basis reduction algorithms
• scientific article; zbMATH DE number 5532102

Cited in

(12)

• On module unique-SVP and NTRU
• Algebraic number fields and the LLL algorithm
• Cloud-assisted LLL: a secure and efficient outsourcing algorithm for approximate shortest vector problem
• Lattices with symmetry
• The special case of cyclotomic fields in quantum algorithms for unit groups
• Application of automorphic forms to lattice problems
• Reductions from module lattices to free module lattices, and application to dequantizing module-LLL
• Cryptanalysis of rank-2 module-LIP in totally real number fields
• Unit reducible fields and perfect unary forms
• Fast reduction of algebraic lattices over cyclotomic fields
• Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP
• Random self-reducibility of ideal-SVP via Arakelov random walks

This page was built for publication: An LLL algorithm for module lattices

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