{'fraction_non_alphanumeric': 0.02135678391959799, 'fraction_numerical': 0.001256281407035176, 'mean_word_length': 5.991228070175438, '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}}
Comparison between 2D cellular automata based pseudorandom number generators

Pseudorandom number generators (PRNGs) should satisfy two main criteria, high randomness quality and fast computation of a sequence of numbers. In this paper, a comparative study of twodimensional Cellular Automata (CA) based PRNGs is performed to evaluate the randomness quality and the hardware constraints involved in terms of configuration parameters such as, transition rules, neighborhoods and bit extraction schemes. Experimental results show that CA-based PRNGs present good randomness quality using standard test suites, and they are well suited for parallel implementations in Field Programmable Gate Array (FPGA) technology taking advantage of the on-chip fine-grain and distributed computational resources.