Abstract
Nonlinear congruential pseudorandom number generators can have unexpectedly short periods. Shamir and Tsaban introduced the class of counter-dependent generators which admit much longer periods. In this paper we present a bound for multiplicative character sums for nonlinear sequences generated by counter-dependent generators. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Gomez, D. (2010). Multiplicative character sums with counter-dependent nonlinear congruential pseudorandom number generators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6338 LNCS, pp. 188–195). https://doi.org/10.1007/978-3-642-15874-2_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
