{'fraction_non_alphanumeric': 0.028703703703703703, 'fraction_numerical': 0.000925925925925926, 'mean_word_length': 5.396449704142012, '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}}
Generating High Quality Pseudo Random Number Using Evolutionary methods

Random number generators represent basic cryptographic primitives. They are widely used in modern security schemes including security protocols, computer security and password sources. In some algorithms (e.g. DSA) or protocols (e.g. zero-knowledge), random numbers are intrinsic to the computation [3]. In all these applications, strength of security depends greatly on the quality of randomness of the source. Pseudo random number generators (PRNGs) play an important role in cryptographic applications, as the security of these systems depends on the assumption that future values in the random sequence can be unpredictable. A linear feedback shift register (LFSR), in effect, implements a binary polynomial generator. These generators find common use for PRNGs. However, the random sequence generated by LFSR can not guarantee the unpredictability in secure system. We have used genetic algorithm to improve LFSR and proposed a novel random number generator with complex architecture and longer period.