Three Rounds Cryptography to Protect Secret Message

A simple three rounds method of message cryptography will be introduced, the message will be encrypted-decrypted by apply XORing operation of the message with the secret KEY1 in the first round, in the second round the message will be shuffled using the secret key KEY2, while in the third round the message binary matrix will be rotated left to a number of selected digits. The introduced method will be very secure it will use a secret kept digital color image as an image_key, this image will be used to generate KEY1 and KEY2. KEY1 will be extracted from the image from a selected position, while KEY2 will be an indices key obtained by sorting a number of bytes extracted from the image from another position determined by the user. In addition to the image_key the method will use the values of POS1, POS2, and NORLD to determine the starting position of key1, the starting position of key2 and the number of rotate left digits. The produced decrypted message will be very sensitive to the selected image_key, POS1, POS2 and NORTD. The encryption function will be simplified and it will be implemented using three simple tasks: XORing, shuffling and rotating left, while the decryption function will be implemented by applying rotate left, shuffling back and XORing operations. The proposed method will be implemented and tested using various messages, the results will be studied and analyzed to prove the achievements provided by the method in: quality, speed, security and sensitivity.