An algorithm for finding a shortest vector in a two-dimensional modular lattice

DOI10.1016/0304-3975(92)00021-IzbMath0795.06009MaRDI QIDQ1318688

Mody Lempel, Azaria Paz

Publication date: 5 April 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

algorithmshortest vectortwo-dimensional modular lattice

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modular lattices, Desarguesian lattices (06C05)

Related Items (3)

Two-Round Oblivious Linear Evaluation from Learning with Errors ⋮ Finding a shortest vector in a two-dimensional lattice modulo m ⋮ Point lattices and oscillating recurrence sequences^†

Cites Work

• Factoring polynomials with rational coefficients
• Worst-case complexity bounds for algorithms in the theory of integral quadratic forms

This page was built for publication: An algorithm for finding a shortest vector in a two-dimensional modular lattice