{'fraction_non_alphanumeric': 0.011737089201877934, 'fraction_numerical': 0.0, 'mean_word_length': 5.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}}
On skew circular convolution algorithms over finite integer rings

In recent work, we have generalized the number-theoretic transforms over finite integer rings and derived fast algorithms for computing convolution of two discrete sequences. In this paper, we describe certain number theoretic results and algorithms that appertain to computing skew circular convolution over finite integer rings and their complex extensions.