{'fraction_non_alphanumeric': 0.01675977653631285, 'fraction_numerical': 0.0, 'mean_word_length': 5.398809523809524, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Discrete Time Chaotic Maps With Application to Random Bit Generation

Chaotic behavior is a term that is attributed to dynamical systems whose solutions are highly sensitive to initial conditions. This means that small perturbations in the initial conditions can lead to completely different trajectories in the solution space. These types of chaotic dynamical systems arise in various natural or artificial systems in biology, circuits, engineering, computer science, and more. This chapter reports on some new chaotic discrete time two-dimensional maps that are derived from simple modifications to the well-known Hénon, Lozi, Sine-Sine, and Tinkerbell maps. Numerical simulations are carried out for different parameter values and initial conditions, and it is shown that the mappings either diverge to infinity or converge to attractors of many different shapes. The application to random bit generation is then considered using a collection of the proposed maps by applying a simple rule. The resulting bit generator successfully passes all statistical tests performed.