Message Cryptography using Two Round of Message Reordering

A highly secure method of message cryptography will be introduced, the method will use a complicated PK, which will provide a high entropy space capable to resist hacking attempts, and the produced decrypted message will be very sensitive to the selected values of the PK components. The PK will be used to generate two chaotic keys; these keys will be converted to indices key to be used to reorder the message contents at the character level and at the bit level. The encryption-decryption process will be implemented in two rounds: the first round will be used to reorder the message characters, while the second round will be used to reorder the message blocks of bits. The PK will be also used to divide the message array of bits to equal blocks. The introduced method will simplify the process of message cryptography by applying simple reordering operations and eliminating the need to use a complex og logical operations used in other methods of message cryptography. The proposed method will be implemented and tested using various short, medium and long messages, the obtained results will be analyzed to prove the enhancements provided by the proposed method in: speed, quality and sensitivity of message cryptography.