Designing Fast Algorithm to Encrypt Images Using The Chinese Remainder Theorem and Elliptic Curve

Sending and receiving information confidentially has always been very important. The cryptography Plays a major role in exchanging information securely. For this purpose, several encryption algorithms are designed and implemented. Among the designed algorithms, the old RSA and Diffie-Hellman algorithms have been superseded by the elliptic curve encryption algorithm, due to its unique features. The proposed method has higher speed for image encryption and decryption in comparison with the current method. For this purpose, the grouping of pixels by remainder Chinese theorem has been employed. The proposed method is applicable on other data such as text, sound and video.