Generation of further pseudorandom binary sequences, I (Blowing up a single sequence)
Christian Mauduit, Katalin Gyarmati, Andràs Sárközy
Abstract
Open-access reader
Christian Mauduit, Katalin Gyarmati, Andràs Sárközy
Abstract
Open-access reader
Assume that a binary sequence is given with strong pseudorandom properties. An algorithm is presented and studied which prepares many further binary sequences from the given one. It is shown that if certain conditions hold then each of the sequences obtained in this way also possesses strong pseudorandom properties. Moreover, \nit is proved that certain large families of these sequences also posses strong pseudorandom properties.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Assume that a binary sequence is given with strong pseudorandom properties. An algorithm is presented and studied which prepares many further binary sequences from the given one. It is shown that if certain conditions hold then each of the sequences obtained in this way also possesses strong pseudorandom properties. Moreover, \nit is proved that certain large families of these sequences also posses strong pseudorandom properties.
Key concepts: Pseudorandom number generator, Pseudorandom binary sequence, Sequence (biology), Binary number, Pseudorandom generator theorem, Pseudorandom noise, Algorithm, Pseudorandomness