THE CRYPTOGRAPHIC SECURITY OF TRUNCATED LINEARLY RELATED VARIABLES.

Abstract

In this paper we describe a polynomial time algorithm for computing the values of variables x//1,. . . ,x//k when some of their bits and some linear relationships between them are known. The algorithm is essentially optimal in its use of information in the sense that it can be applied as soon as the values of the x//i become uniquely determined by the constraints. Its cryptanalytic significance is demonstrated by two applications: breaking linear congruential generators whose outputs are truncated, and breaking Blum's protocol for exchanging secrets.