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:

    Jesus wept.
    Bible: New Testament John, 11:35.

    The shortest verse in the Bible; refers to Jesus’ grief at the death of Lazarus, whom he raised from the dead after four days.

    The soul of me is very selfish. I have gone my way after a fashion that made me the center of the plan. And you who are so individual, who are so independent a spirit, whose soul is also a kingdom, have been so loyal, so forgiving, so self-sacrificing in your willingness to live my life. Nothing but love cold have accomplished so wonderful a thing.
    Woodrow Wilson (1856–1924)

    I tell you, sir, the only safeguard of order and discipline in the modern world is a standardized worker with interchangeable parts. That would solve the entire problem of management.
    Jean Giraudoux (1882–1944)