Shortest Independent Vectors Problem

${\mathrm{SIVP}}_{\gamma }$ asks, given a basis of an $n$-dimensional lattice, for $n$ linearly independent lattice vectors whose longest is within a factor $\gamma$ of the smallest achievable; it is one of the two worst-case lattice problems that LWE and SIS reduce from.

TODO: syntax and security definition.

Participates in

Builds on Shortest Independent Vectors Problem

• SIVP ⇒ LWE
• SIVP ⇒ SIS