8 research outputs found
On lattice profile of the elliptic curve linear congruential generators
Lattice tests are quality measures for assessing the intrinsic structure of pseudorandom number generators. Recently a new lattice test has been introduced by Niederreiter and Winterhof. In this paper, we present a general inequality that is satisfied by any periodic sequence. Then, we analyze the behavior of the linear congruential generators on elliptic curves (EC-LCG) under this new lattice test and prove that the EC-LCG passes it up to very high dimensions. We also use a result of Brandstätter and Winterhof on the linear complexity profile related to the correlation measure of order k to present lower bounds on the linear complexity profile of some binary sequences derived from the EC-LCG
The microstructure of (t, m, s)-nets
10.1006/jcom.2001.0596Journal of Complexity174683-69
Discrepancy estimates for point sets on the S-Dimensional sierpiński carpet
No Abstract.Quaestiones Mathematicae Vol. 27 (3) 2004: pp. 375-39