Lattice Basis Reduction with Dynamic Approximation

Abstract. In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the new heuristic is more efficient in reducing large problem instances and extends the applicability of the Schnorr-Euchner algorithm such that problem instances that the stateof-the-art method fails to reduce can be solved using our new technique.

• Type: Conference
• Year: 2000
• Where: WAE
• Authors: Werner Backes, Susanne Wetzel
• Keywords: Basis Reduction Algorithm, Large Problem Instances, Problem Instances, WAE 2000, WAE 2001