{'fraction_non_alphanumeric': 0.019639934533551555, 'fraction_numerical': 0.0, 'mean_word_length': 4.941747572815534, '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}}
A Statistical Analysis on In-Built Pseudo Random Number Generators Using NIST Test Suite

All programming languages have a built-in function for Pseudo-Random Number Generators (PRNGs) for the ease of programmers. The algorithms used to generate Pseudo-Random Numbers (PRNs) are mainly focused on time complexity. The question we are interested in is to check if the PRNs generated using these inbuilt functions are good enough for the use in cryptography. Here we analyze the results obtained by standard NIST tests applied on PRNs generated by the functions in some of the commonly used programming languages.