{'fraction_non_alphanumeric': 0.02666666666666667, 'fraction_numerical': 0.017142857142857144, 'mean_word_length': 4.655913978494624, '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}}
Pseudorandom number generation based on nongroup cellular automata

The orbits of quadratic functions in GF(2/sup n/) presents cycles of maximal length 2/sup n-l/-2. The characterization of the coefficient b allows the generation of such sequences for every n/spl ges/4. A pseudorandom sequence generator based on these functions is developed by means of a nongroup hybrid additive cellular automata. A simpler nongroup CA can replace the original CA derived from the quadratic function defined by the usual rules 90 and 150.