{'fraction_non_alphanumeric': 0.015286624203821656, 'fraction_numerical': 0.0, 'mean_word_length': 5.140625, '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}}
Cryptanalysis of Multiplicative Coupled Cryptosystems Based on the Chebyshev Polynomials

In this work, we propose a class of public-key cryptosystems called multiplicative coupled cryptosystem, or MCC for short, as well as discuss its security within three different models. Moreover, we discuss a chaotic instance of MCC based on the first and the second types of Chebyshev polynomials over real numbers for these three security models. To avoid round-off errors in floating point arithmetic as well as to enhance the security of the chaotic instance discussed, the Chebyshev polynomials of the first and the second types over a finite field are employed. We also consider the efficiency of the proposed MCCs. The discussions throughout the paper are supported by practical examples.