{'fraction_non_alphanumeric': 0.016229712858926344, 'fraction_numerical': 0.0, 'mean_word_length': 4.854014598540146, '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}}
Grid Computing Framework

The evolution of the Web and the growth of computational power of the clients, have led to new possibilities to solve computational puzzles such as the factorization of large numbers. Instead of using a mainframe to do this kind of work, clusters of distributed machines, called grids, are used. These grids are built with the help of lots of participants devoting their unused CPU cycles to the grid computing projects. This thesis’ goal was to evaluate the different existing frameworks for grid computing and to use one of these frameworks to attack the ECC Challenge, avoiding selfish behavior. We decided to extend the BOINC framework for our purposes. In particular, we added distributed checking mechanisms to fend off cheaters while the overhead at the server is low.