Timeline for Find an example of a lattice such that LLL algorithm can't find the shortest vector of the lattice, satisfying
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 23, 2016 at 5:39 | vote | accept | Leafar | ||
| Jun 23, 2016 at 2:47 | answer | added | Samuel Neves | timeline score: 7 | |
| Jun 22, 2016 at 22:04 | comment | added | Leafar | Thanks for commenting, I agree, $2^{25}$ is "treatable", but instead of 5 minutes of testing all possibilities, with 25 we have to wait 3.5 days... I will try to increase $n$ or $r$ | |
| Jun 22, 2016 at 1:42 | comment | added | Samuel Neves | Given that LLL guarantees a vector within $2^{(n-1)/2}$ from optimal, and it tends to behave better than that in practice, $15$ is probably too short of a target. Increasing this limit to $25$ makes it easier to find examples. | |
| Jun 20, 2016 at 19:06 | history | asked | Leafar | CC BY-SA 3.0 |