On stern's attack against secret truncated linear congruential generators

Authors:
Scott Contini;Igor E. Shparlinski
Affiliations:
Department of Computing, Macquarie University, Australia;Department of Computing, Macquarie University, Australia
Venue:
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Year:
2005

Citing 7
Cited 4

A hierarchy of polynomial time lattice basis reduction algorithms

Theoretical Computer Science
Reconstructing truncated integer variables satisfying linear congruences

SIAM Journal on Computing - Special issue on cryptography
Inferring sequences produced by pseudo-random number generators

Journal of the ACM (JACM)
Inferring sequences produced by a linear congruential generator missing low-order bits

Journal of Cryptology
Random number generation and quasi-Monte Carlo methods

Random number generation and quasi-Monte Carlo methods
A sieve algorithm for the shortest lattice vector problem

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Secret linear congruential generators are not cryptographically secure

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science

Quantum period reconstruction of approximate sequences

Information Processing Letters
On pseudorandom numbers from multivariate polynomial systems

Finite Fields and Their Applications
I forgot your password: randomness attacks against PHP applications

Security'12 Proceedings of the 21st USENIX conference on Security symposium
Predicting masked linear pseudorandom number generators over finite fields

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.