In this paper, a family of nonlinear congruential generators (NLCGs) based on the digitized Rényi map is considered for the definition of hardware-efficient pseudorandom number generators (PRNGs), and a theoretical framework for their study is presented. The authors investigate how the nonlinear structure of these systems eliminates some of the statistical regularities spoiling the randomness of sequences generated with linear techniques. In detail, in this paper, a necessary condition that the considered NLCGs must satisfy to have maximum period length is given, and a list of such maximum period PRNGs for period lengths up to 231 - 1 is provided. Referring to the NIST800-22 statistical test suite, two PRNG examples are presented and compared to well-known PRNGs based on linear recurrencies requiring a similar amount of resources for their implementation. © 2007 IEEE.
Addabbo, T., Alioto, M.B.C., Fort, A., Pasini, A., Rocchi, S., Vignoli, V. (2007). A Class of Maximum-Period Nonlinear Congruential Generators Derived From the Rényi Chaotic Map. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS. I, REGULAR PAPERS, 54(4), 816-828 [10.1109/TCSI.2007.890622].
A Class of Maximum-Period Nonlinear Congruential Generators Derived From the Rényi Chaotic Map
ADDABBO, TOMMASO;ALIOTO, MASSIMO BRUNO CRIS;FORT, ADA;PASINI, ANTONIO;ROCCHI, SANTINA;VIGNOLI, VALERIO
2007-01-01
Abstract
In this paper, a family of nonlinear congruential generators (NLCGs) based on the digitized Rényi map is considered for the definition of hardware-efficient pseudorandom number generators (PRNGs), and a theoretical framework for their study is presented. The authors investigate how the nonlinear structure of these systems eliminates some of the statistical regularities spoiling the randomness of sequences generated with linear techniques. In detail, in this paper, a necessary condition that the considered NLCGs must satisfy to have maximum period length is given, and a list of such maximum period PRNGs for period lengths up to 231 - 1 is provided. Referring to the NIST800-22 statistical test suite, two PRNG examples are presented and compared to well-known PRNGs based on linear recurrencies requiring a similar amount of resources for their implementation. © 2007 IEEE.File | Dimensione | Formato | |
---|---|---|---|
J30.pdf
non disponibili
Tipologia:
Post-print
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
1.31 MB
Formato
Adobe PDF
|
1.31 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/21467
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo