Guassian Lattice Reduction Algorithm in Two-Dimensions

Abstract

An approximation approach for the shortest vector problem, the Lenstra-Lenstra-Lovasz (LLL) Algorithm completes its computations in polynomial time and produces an estimate that is within an exponential factor of the true solution. It's a technique that can be used in practice and is accurate enough to crack cryptosystems, factor polynomials over integers, and solve integer linear programming problems. For the purpose of using the Gauss method "inside" We present a comprehensive examination of the LLL method in the context of a collection of realistic probabilistic models. The proofs focus on both the underlying dynamical systems and the transfer operators. Finding a lattice of Euclidean space with a short basis from a skewed starting point is known as the lattice reduction problem. Especially in cryptology, lattice reduction techniques offer remarkable use in mathematics and computer science.