1999
DOI: 10.1006/ffta.1999.0257
|View full text |Cite
|
Sign up to set email alerts
|

On the Distribution and Lattice Structure of Nonlinear Congruential Pseudorandom Numbers

Abstract: The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. In this paper we present a new type of discrepancy bound for sequences of s-tuples of successive nonlinear congruential pseudorandom numbers and a result on the s-dimensional lattice structure.1999 Academic Press

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
26
0
1

Year Published

2000
2000
2008
2008

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 52 publications
(29 citation statements)
references
References 13 publications
2
26
0
1
Order By: Relevance
“…We remark that for small e some nontrivial results can be derived from the estimates of the paper [24] which, although rather weak, apply to general polynomial generators.…”
Section: Introductionmentioning
confidence: 94%
See 2 more Smart Citations
“…We remark that for small e some nontrivial results can be derived from the estimates of the paper [24] which, although rather weak, apply to general polynomial generators.…”
Section: Introductionmentioning
confidence: 94%
“…In [24] the above bound has been used to obtain a nontrivial estimate for very general pseudorandom number generators. Nevertheless, for our purposes a direct application of the bound would give us rather weak results, the problem being that the dependence therein on the degree is not very good and the polynomials to which our argument naturally leads are in some cases of very high degree.…”
Section: Lemma 24 For Any Integersmentioning
confidence: 99%
See 1 more Smart Citation
“…Consider the innermost sum on the right-hand side of (8). If applications to combinatorial design theory (see [2] for such applications).…”
Section: -mentioning
confidence: 99%
“…Here we show that the original method of [20], and more recently also used in [8,9], combined with bounds for exponential sums with sparse polynomials from [12] allows us to study the distribution of the power generator of pseudorandom numbers over a residue ring. In particular, in [12] a distribution result for the sequence generated by (1) has been established for the sequence over the entire period.…”
Section: Introductionmentioning
confidence: 98%