Abstract
Pseudorandom sequences are widely used in cryptography. Multiple recursive generators are an important class of pseudorandom sequence generators. A typical application is to obtain truncated sequences by truncating partial bits of the sequences output by the generators. This paper studies the predictability of truncated multiple recursive generators with unknown parameters. Given a few truncated digits of high-order bits output by a multiple recursive generator, we give a method based on lattice reduction to recover the parameters and the initial state of the generator. Our method is an extension of Stern’s algorithm which was proposed to predict the truncated sequences of linear congruential generators.
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 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.
