Average hardness of SIVP for module lattices of fixed rank

Koen de Boer, Aurel Page, Radu Toma +1

The problem of finding short vectors in Euclidean lattices is a central hard problem in complexity theory. The case of module lattices (i.e., lattices which are also modules over a…