Asset Details
Do you wish to reserve the book?
Predicting truncated multiple recursive generators with unknown parameters
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Predicting truncated multiple recursive generators with unknown parameters
Do you wish to request the book?
Predicting truncated multiple recursive generators with unknown parameters
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Predicting truncated multiple recursive generators with unknown parameters
2020
Overview
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.
Publisher
Springer Nature B.V
Subject
