{'fraction_non_alphanumeric': 0.02321981424148607, 'fraction_numerical': 0.0, 'mean_word_length': 5.161904761904762, '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}}
Proof and Improvement of Shantz’s Modular Division and Lórencz’s Modular Inverse Algorithms

Modular division or inverse is fundamental in finite field arithmetic, and it widely exists in cryptosystems like elliptic curve cryptography. Shantz’s algorithm can be easily used for modular division in addition to the plus and minus methods. Nevertheless, a proof of the algorithm is in lack in the literature so far. This work presents a proof of Shantz’s algorithm by matrix transforms. Also, Lorencz’s modular inverse algorithm is innovative in applying left-shift operations, for which an analysis and an improvement are also given in this paper.