Abstract
We propose a system of multiple recursive generators of moduluspand orderkwhere all nonzero coefficients of the recurrence are equal. The advantage of this property is that a single multiplication is needed to compute the recurrence, so the generator would run faster than the general case. Forp= 231− 1, the most popular modulus used, we provide tables of specific parameter values yielding maximum period for recurrence of orderk= 102 and 120. Forp= 231− 55719 andk= 1511, we have found generators with a period length approximately 1014100.5.
Sign-in/Register to access full text options 
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 callMore From: ACM Transactions on Modeling and Computer Simulation
Disclaimer: 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.
