Answers are grounded in this paper and cite their sources.
This brief approximates the hidden Markov model of chaotic-map truly random number generators (TRNGs) and describes its fundamental limits based on the approximate entropy rate of the underlying bit-generation process. It is demonstrated that the entropy rate plays a key role in the performance and robustness of chaotic-map TRNGs, which must be taken into account in the circuit design optimization. Finally, the optimality conditions for postprocessing units that extract truly random bits from a raw random number generator are derived.
No takes yet. Share an insight, caveat, or question.
Beirami et al. (2013) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: