Lattice reductions over Euclidean rings with applications to cryptanalysis

DOI10.1007/978-3-319-71045-7_19zbMath1397.94081OpenAlexW2770562900MaRDI QIDQ1744870

Taechan Kim, Changmin Lee

Publication date: 20 April 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-71045-7_19

zbMATH Keywords

cryptanalysislatticesLLL algorithmdiscrete logarithm problemsnumber field sieve

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (5)

Unit reducible fields and perfect unary forms ⋮ The special case of cyclotomic fields in quantum algorithms for unit groups ⋮ Subfield algorithms for ideal- and module-SVP based on the decomposition group ⋮ Fast reduction of algebraic lattices over cyclotomic fields ⋮ Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP

This page was built for publication: Lattice reductions over Euclidean rings with applications to cryptanalysis