LATTICE REDUCTION - A TOOLBOX FOR THE CRYPTANALYST

In recent years, methods based on lattice reduction have been used rep eatedly for the cryptanalytic attack of various systems. Even if they do not rest on highly sophisticated theories, these methods may look a bit intricate to practically oriented cryptographers, both from the m athematical and the algorithmic point of view. The aim of this paper i s to explain what can be achieved by lattice reduction algorithms, eve n without understanding the actual mechanisms involved. Two examples a re given. One is the attack devised by the second author against Knuth 's truncated linear congruential generator. This attack was announced a few years ago and appears here for the first time in complete detail .