{'fraction_non_alphanumeric': 0.03856749311294766, 'fraction_numerical': 0.01652892561983471, 'mean_word_length': 4.777777777777778, '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 Trace Based GF(2n) Inversion Algorithm

By associating Fermat’s Little Theorem based GF (2 n ) inversion algorithms with the multiplicative Norm function, we present an additive Trace based GF (2 n ) inversion algorithm. For elements with Trace value 0, it needs 1 less multiplication operation than Fermat’s Little Theorem based algorithms in some GF (2 n ) s.