A chaotic-map random number generator (RNG) is defined using a chaotic map and a bit-generation function. When the map function is exactly known, for a given bit-generation function, the entropy-rate of the generated output bit sequence is asymptotically the highest rate at which truly random bits can be generated from the map. The supremum of the entropy-rate amongst all bit-generation functions is called the binary metric entropy, which is the highest rate at which information can be extracted from any given map using the optimal bit-generation function. In this paper, we provide converse and achievable bounds on the binary metric entropy. The achievability is based on a sequence of universal bit-generation functions in the sense that the bit-generation function is not dependent on the specific map. The proposed sequence of bit-generation functions offers a fairly simple implementation which can easily be realized on hardware for practical purposes.

Fundamental performance limits of chaotic-map random number generators / Beirami, Ahmad; Nejati, Hamid; Callegari, Sergio. - STAMPA. - (2014), pp. 7028581.1126-7028581.1131. (Intervento presentato al convegno 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014 tenutosi a Allerton, USA nel 2014) [10.1109/ALLERTON.2014.7028581].

Fundamental performance limits of chaotic-map random number generators

Abstract

A chaotic-map random number generator (RNG) is defined using a chaotic map and a bit-generation function. When the map function is exactly known, for a given bit-generation function, the entropy-rate of the generated output bit sequence is asymptotically the highest rate at which truly random bits can be generated from the map. The supremum of the entropy-rate amongst all bit-generation functions is called the binary metric entropy, which is the highest rate at which information can be extracted from any given map using the optimal bit-generation function. In this paper, we provide converse and achievable bounds on the binary metric entropy. The achievability is based on a sequence of universal bit-generation functions in the sense that the bit-generation function is not dependent on the specific map. The proposed sequence of bit-generation functions offers a fairly simple implementation which can easily be realized on hardware for practical purposes.
Scheda breve Scheda completa Scheda completa (DC)
2014
2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014
1126
1131
Fundamental performance limits of chaotic-map random number generators / Beirami, Ahmad; Nejati, Hamid; Callegari, Sergio. - STAMPA. - (2014), pp. 7028581.1126-7028581.1131. (Intervento presentato al convegno 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014 tenutosi a Allerton, USA nel 2014) [10.1109/ALLERTON.2014.7028581].
Beirami, Ahmad; Nejati, Hamid; Callegari, Sergio
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/521562
Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

• ND
• 7
• 6