Abstract
Nonlinear congruential methods for generating uniform pseudorandom numbers show several attractive properties. The present paper deals with a particularly simple compound approach, which is based on cubic permutation polynomials over finite fields. These pseudorandom number generators allow a fast (and parallelized) implementation in single precision. Statistical independence properties of the generated sequences are studied. An upper bound for the discrepancy of tuples of successive pseudorandom numbers is established, which rests on a classical result of A. Weil on exponential sums. Finally, a ready-to-program example of a compound cubic congruential generator is given.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
