MRBM Reordering for Efficient Secret Message Cryptography

An efficient method of secret message cryptography will be introduced; this method will be efficiently used to encrypt-decrypt short and long messages. The introduced method will use a simplified encryption and decryption functions, these functions will use a simple message bits reordering to get the encrypted and decrypted messages, the reordering operations will be applied based on the contents of the generated secret indices key. A private key will be used to generate the required indices key, this key will have a long key capable to provide a huge key space to protect hacking attacks, the produced decrypted message will be sensitive to the selected values of the private key components. The private key components will be used to run a simple chaotic logistic map model to generate a chaotic key, which will be sorted to form the indices key. The introduced method will be tested using various messages; the obtained results will be analyzed to prove that this method will satisfy the speed and quality requirements of good crypto system. The obtained speed results will be compared with other existing methods speeds to show how the proposed method will speed up the process of message cryptography by decreasing the encryption-decryption time.