Affiliation:
1. Univ. of Chicago, Chicago, IL
Abstract
In this paper, efficient algorithms are given for inferring sequences produced by certain pseudo-random number generators. The generators considered are all of the form
X
n
= Σ
k
j-l
α
j
φ
j
(
X
o
,
X
l
, . . .,
X
n-l
) (mod
m
). In each case, we assume that the functions φ
j
are known and polynomial time computable, but that the coefficients aj and the modulus
m
are unknown. Using this general method, specific examples of generators having this form, the linear congruential method, linear congruences with
n
terms in the recurrence, and quadratic congruences are shown to be cryptographically insecure.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference20 articles.
1. BOYAR J. Missing low order bits in a linear congruential generator. J. Crypt. to appear. BOYAR J. Missing low order bits in a linear congruential generator. J. Crypt. to appear.
2. Nondeterministic Algorithms
Cited by
61 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献