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.
['Ali Shakiba', 'M. R. Hooshmandasl', 'Mohsen Alambardar Meybodi']
Cryptanalysis of Multiplicative Coupled Cryptosystems Based on the Chebyshev Polynomials