An LLL algorithm for module lattices

DOI10.1007/978-3-030-34621-8_3zbMath1455.94178OpenAlexW2990210371MaRDI QIDQ2176639

Damien Stehlé, Changmin Lee, Alice Pellet-Mary, 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

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

Related Items (9)

Application of automorphic forms to lattice problems ⋮ Algebraic number fields and the LLL algorithm ⋮ Unit reducible fields and perfect unary forms ⋮ On module unique-SVP and NTRU ⋮ The special case of cyclotomic fields in quantum algorithms for unit groups ⋮ Reductions from module lattices to free module lattices, and application to dequantizing module-LLL ⋮ 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