{'fraction_non_alphanumeric': 0.009191176470588236, 'fraction_numerical': 0.0, 'mean_word_length': 5.123595505617978, '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}}
Fast decryption algorithms for the RSA cryptosystem

We present four methods to increase the decryption speed of the RSA cryptosystem. The decryption exponent d is obtained by means of special constructions, and the two secret primes p and q are chosen such that the difference between them has low Hamming weight. The suggested methods do not shorten the length of the secret decryption exponent. By applying the Chinese remainder theorem to the special decryption exponent, the decryption speed of the RSA algorithm is significantly increased