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:
“Cultivated labor drives out brute labor. An infinite number of shrewd men, in infinite years, have arrived at certain best and shortest ways of doing, and this accumulated skill in arts, cultures, harvestings, curings, manufactures, navigations, exchanges, constitutes the worth of our world to-day.”
—Ralph Waldo Emerson (1803–1882)
“I have an intense personal interest in making the use of American capital in the development of China an instrument for the promotion of the welfare of China, and an increase in her material prosperity without entanglements or creating embarrassment affecting the growth of her independent political power, and the preservation of her territorial integrity.”
—William Howard Taft (1857–1930)
“The problem with marriage is that it ends every night after making love, and it must be rebuilt every morning before breakfast.”
—Gabriel García Márquez (b. 1928)