Random lattices,threshold phenomena and efficient reduction algorithms |
| |
Affiliation: | Department d’ Informatique, Universite de Caen - Campus II, F-14032 Caen, Cedex, France |
| |
Abstract: | Two new lattice reduction algorithms are presented and analyzed. These algorithms, called the Schmidt reduction and the Gram reduction, are obtained by relaxing some of the constraints of the classical LLL algorithm. By analyzing the worst case behavior and the average case behavior in a tractable model, we prove that the new algorithms still produce “good” reduced basis while requiring fewer iterations on average. In addition, we provide empirical tests on random lattices coming from applications, that confirm our theoretical results about the relative behavior of the different reduction algorithms. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|