{'fraction_non_alphanumeric': 0.011701170117011701, 'fraction_numerical': 0.0018001800180018, 'mean_word_length': 5.354285714285714, '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}}
Gathering entropy from the grid with GridHAVEGE

The HAVEGE algorithm [1,2] generates unpredictable random numbers by gathering entropy from internal processor states that are inheritably volatile and impossible to tamper with in a controlled fashion by any application running on the target system. The method used to gather the entropy implies that its main loop will almost monopolize the CPU; the output depends on the operating system and other running applications, as well as some internal mechanisms that stir the processor states to generate an enormous amount of entropy. The algorithm was designed with the idea of single-core CPUs in mind, and no parallelization; however the recent advances in Grid technologies and infrastructures justifies the need to research a gridified parallel version of HAVEGE, capable of running the same algorithm loop on each Grid worker node independently and transparently combine the results in one single output bitstream. This paper will demonstrate how such a gridification is possible and benchmark the quality of the resulting generator which we call GridHAVEGE.