Lattice Problem - Shortest Vector Problem (SVP)

Shortest Vector Problem (SVP)

In SVP, a basis of a vector space V and a norm N (often L2) are given for a lattice L and one must find the shortest non-zero vector in V, as measured by N, in L. In other words, the algorithm should output a non-zero vector v such that .

In the -approximation version, one must find a non-zero lattice vector of length at most .

Read more about this topic:  Lattice Problem

Famous quotes containing the words shortest and/or problem:

    The Gettysburg speech is at once the shortest and the most famous oration in American history. Put beside it, all the whoopings of the Websters, Sumners and Everetts seem gaudy and silly. It is eloquence brought to a pellucid and almost gem-like perfection—the highest emotion reduced to a few poetical phrases.
    —H.L. (Henry Lewis)

    You are a problem and rune,
    you are mystery;
    writ on a stone.
    Hilda Doolittle (1886–1961)