Lattice Problem - Shortest Independent Vector Problem (SIVP)

Shortest Independent Vector Problem (SIVP)

Given a lattice L of dimension n, the algorithm must output n linearly independent so that where the right hand side considers all basis of the lattice.

In the -approximate version, given a lattice L with dimension n, find n linearly independent vectors of length max |||| ≤, where is the 'th succesive mininum of .

Read more about this topic:  Lattice Problem

Famous quotes containing the words shortest, independent and/or problem:

    The shortest way out of Manchester is notoriously a bottle of Gordon’s gin; out of any businessman’s life there is the mirage of Paris; out of Paris, or mediocrity of talent and imagination, there are all the drugs, from subtle, all-conquering opium to cheating, cozening cocaine.
    William Bolitho (1890–1930)

    The dignity and stability of government in all its branches, the morals of the people, and every blessing of society, depend so much upon an upright and skilful administration of justice, that the judicial power ought to be distinct from both the legislative and executive, and independent upon both, that so it may be a check upon both, as both should be checks upon that.
    Thomas Jefferson (1743–1826)

    But a problem occurs about nothing. For that from which something is made is a cause of the thing made from it; and, necessarily, every cause contributes some assistance to the effect’s existence.
    Anselm of Canterbury (1033–1109)