First Page | Document Content | |
---|---|---|
Date: 2010-11-22 05:03:50 | A COMPLETE WORST-CASE ANALYSIS OF KANNAN’S SHORTEST LATTICE VECTOR ALGORITHM ´† GUILLAUME HANROT∗ AND DAMIEN STEHLE Abstract. Computing a shortest nonzero vector of a given euclidean lattice and computing a closesAdd to Reading ListSource URL: perso.ens-lyon.frDownload Document from Source WebsiteFile Size: 416,92 KBShare Document on Facebook |