{'fraction_non_alphanumeric': 0.0078125, 'fraction_numerical': 0.0, 'mean_word_length': 6.122222222222222, '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 by Inversive Methods

The classical linear congruential method for generating uniform pseudorandom numbers has some deficiencies that can render them useless for some simulation problems. This fact motivated the design and analysis of nonlinear congruential methods for the generation of pseudorandom numbers. Inversive methods are an interesting and very promising approach to produce uniform pseudorandom numbers. We present a critical analysis of the recent developments on the topic. Our exposition concentrates on recursive inversive congruential generators and digital inversive congruential generators.