Reconstructing Truncated Integer Variables Satisfying Linear Congruences

• Published in: SIAM journal on computing Vol. 17; no. 2; pp. 262 - 280
• Main Authors: Frieze, Alan M., Hastad, Johan, Kannan, Ravi, Lagarias, Jeffrey C., Shamir, Adi
• Format: Journal Article
• Language: English
• Published: Philadelphia Society for Industrial and Applied Mathematics 01.04.1988
• Subjects: Algorithms; Generators
• ISSN: 0097-5397; 1095-7111
• DOI: 10.1137/0217016

We propose a general polynomial time algorithm to find small integer solutions to systems of linear congruences. We use this algorithm to obtain two polynomial time algorithms for reconstructing the values of variables $x_1 , \cdots ,x_k $ when we are given some linear congruences relating them together with some bits obtained by truncating the binary expansions of the variables. The first algorithm reconstructs the variables when either the high order bits or the low order bits of the $x_i $ are known. It is essentially optimal in its use of information in the sense that it will solve most problems almost as soon as the variables become uniquely determined by their constraints. The second algorithm reconstructs the variables when an arbitrary window of consecutive bits of the variables is known. This algorithm will solve most problems when twice as much information as that necessary to uniquely determine the variables is available. Two cryptanalytic applications of the algorithms are given: predicting linear congruential generators whose outputs are truncated and breaking the simplest version of Blum's protocol for exchanging secrets.