{'fraction_non_alphanumeric': 0.023728813559322035, 'fraction_numerical': 0.0, 'mean_word_length': 5.420289855072464, '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}}
Rader–Brenner Algorithm for Computing New Mersenne Number Transform

Error-free convolutions and correlations can be efficiently computed using number theoretic transforms. One particular transform, which is known as the new Mersenne number transform (NMNT), can be used for the calculation of long-length convolutions/correlations. In this brief, a new decimation-in-time algorithm for the fast calculation of the NMNT based on the Rader-Brenner approach is proposed. The structure of the NMNT can be further improved by means of the developed algorithm, which involves multiplication by constants that are simpler than vector rotation. In terms of arithmetic operation, the proposed algorithm achieves the lowest number of multiplication among all known butterfly-style algorithms. An example of large integer multiplication is given to prove the validity of the developed algorithm.