{'fraction_non_alphanumeric': 0.016722408026755852, 'fraction_numerical': 0.0, 'mean_word_length': 5.655555555555556, '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}}
An Efficient Sieve Algorithm with Evolutionary Technique

Sieve algorithm plays an important role in solving the shortest vector problem, which is one of the most representative hard lattice problems. In this paper, we propose an efficient sieve algorithm with evolutionary techniques. By combining Gauss Sieve algorithm with global selection, we propose an efficient sieve algorithm. Experimental results show that our algorithm performs better than FPLLL’s Gauss Sieve algorithm in solving the shortest vector problem. Furthermore, we explore how mutation behaves in accelerating sieve algorithm.