On Stern’s Attack Against Secret Truncated Linear Congruential Generators
In 1987, Stern showed how the parameters for secret truncated linear congruential generators could be derived in polynomial time. Here, we present a modification to that algorithm which makes it simpler, more robust, and require less data. We then present a more careful analysis of the algorithm, and establish some limits of its applicability. Thus, secret truncated linear congruential generators may not necessarily be insecure for properly chosen parameters. Unfortunately, as in the original algorithm, all the results remain heuristic, however we present results of numerical experiments which support our conclusions.
KeywordsPolynomial Time Approximation Factor Great Common Divisor Basis Reduction Lattice Reduction
Unable to display preview. Download preview PDF.
- 1.Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proc. 33rd ACM Symp. on Theory of Comput., pp. 601–610. ACM, New York (2001)Google Scholar
- 10.Kurlberg, P., Pomerance, C.: On the period of the linear congruential and power generators. Acta Arith. (to appear)Google Scholar
- 11.Lenstra, A.K., Lenstra, H.W., Lovász, L.: Factoring polynomials with rational coefficients. Mathematische Ann. 261, 513–534 (1982)Google Scholar
- 12.Magma Computer Algebra Package, http://magma.maths.usyd.edu.au/magma/
- 16.Stern, J.: Secret linear congruential generators are not cryptographically secure. In: Proc. 28th IEEE Symp. on Found. of Comp. Sci., pp. 421–426. IEEE, Los Alamitos (1987)Google Scholar