In this paper we propose an efficient low-hardware complexity post-processing module for a feedback-corrected chaos-based True Random Bit Generator (TRBG) with high Average Shannon Entropy (ASE). The design of the postprocessing module was based both on the theoretical analysis of the information generation mechanism of the considered source and on numerical simulations. A prototype of the module was tested on an implementation of the TRBG with an actual ASE slightly lower than 1 bit/time step, obtaining random sequences that fully pass all the well-known statistical tests of the Diehard suite.
Addabbo, T., Alioto, M.B.C., Fort, A., Rocchi, S., Vignoli, V. (2006). Efficient Post-Processing Module for a Chaos-based Random Bit Generator. In Proceedings of the13th IEEE International Conference on Electronics, Circuits and Systems (ICECS '06) (pp.1224-1227) [10.1109/ICECS.2006.379682].
Efficient Post-Processing Module for a Chaos-based Random Bit Generator
ADDABBO, TOMMASO;ALIOTO, MASSIMO BRUNO CRIS;FORT, ADA;ROCCHI, SANTINA;VIGNOLI, VALERIO
2006-01-01
Abstract
In this paper we propose an efficient low-hardware complexity post-processing module for a feedback-corrected chaos-based True Random Bit Generator (TRBG) with high Average Shannon Entropy (ASE). The design of the postprocessing module was based both on the theoretical analysis of the information generation mechanism of the considered source and on numerical simulations. A prototype of the module was tested on an implementation of the TRBG with an actual ASE slightly lower than 1 bit/time step, obtaining random sequences that fully pass all the well-known statistical tests of the Diehard suite.File | Dimensione | Formato | |
---|---|---|---|
C41.pdf
non disponibili
Tipologia:
Post-print
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
407.99 kB
Formato
Adobe PDF
|
407.99 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/34931
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo