Abstract
This paper presents generalized feedback shift register (GFSR) generators with primitive polynomials x p + x p -1 + x q + x q -1 + 1. The recurrence of these generators can be efficiently computed. We adopt Fushimi's initialization scheme, which guarantees the k -distribution property. Statistical and timing results are presented.
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.
