Study On The Lattice Reduction Algorithm

It is a common measure that employing some mathematical hard problems in crypto scheme designing. A good crypto scheme should be secure and efficient. It is well known that lattice has typical linear structure and some lattice problems have been proven to be NP-hard. A crypto scheme based on lattice hard problems can be expected to be secure as well as efficient. Because of these potential advantages, many scholars focus on constructing crypto schemes on lattice.Lattice reduction is not only an important task of lattice research but also a powerful tool for cryptology .Many lattice problems can be solved by lattice reduction directly, and even some NP-hard lattice problems can be approximately solved by reduction. On the other hand, some cryptanalysis can be reduced to lattice reduction problems. Therefore, to design new lattice reduction algorithms has great value in lattice research as well as in practical applications. This paper suggested a new improving lattice algorithm: SDR based on Schnorr's algorithm.At the same time ,it operate a systematical analysis on it.