In this brief, a family of discretized one-dimensional chaotic maps derived from the Sawtooth map is analyzed to evaluate its suitability for the integrated implementation of low-complexity digital pseudorandom bit generators (PRBGs). The proposed PRBGs, classifiable as nonlinear congruential generators, are investigated in terms of period length, statistical properties of the generated sequences, hardware complexity, and are compared with traditional PRBGs.
Addabbo, T., Alioto, M.B.C., Fort, A., Rocchi, S., Vignoli, V. (2006). Low Hardware Complexity PRBG Based on a Piecewise Linear Chaotic Map. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS. II, EXPRESS BRIEFS, 53(5), 329-333 [10.1109/TCSII.2005.862176].
Low Hardware Complexity PRBG Based on a Piecewise Linear Chaotic Map
ADDABBO, TOMMASO;ALIOTO, MASSIMO BRUNO CRIS;FORT, ADA;ROCCHI, SANTINA;VIGNOLI, VALERIO
2006-01-01
Abstract
In this brief, a family of discretized one-dimensional chaotic maps derived from the Sawtooth map is analyzed to evaluate its suitability for the integrated implementation of low-complexity digital pseudorandom bit generators (PRBGs). The proposed PRBGs, classifiable as nonlinear congruential generators, are investigated in terms of period length, statistical properties of the generated sequences, hardware complexity, and are compared with traditional PRBGs.
| File | Dimensione | Formato | |
|---|---|---|---|
|
J24.pdf
non disponibili
Tipologia:
Post-print
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
378.81 kB
Formato
Adobe PDF
|
378.81 kB | 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/3166
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo