Improving the Use of Chaotic Keys in Message Cryptography

Using chaotic logistic keys in message cryptography is a popular technique; it provides a high level of message security by protecting it from being hacked. This technique becomes inefficient when the message length is big, because a chaotic key of big length requires much time to be generated. To overcome this problem this paper research will provide a novel method for short and long messages cryptography. The new method will use a complicated private key which will provide a huge key space to resist any kids of attacks. The private key will be used to divide the message into equal blocks (except the last block), and it will be also used to generate the index keys which are required to apply encryption and decryption, these keys will be generated from the obtained chaotic logistic keys. The proposed method will use a simple encryption and decryption functions, these functions will use the index keys values to distribute the source message to form the encrypted message and to retrieve the decrypted message from the encrypted one. A recommendation of message dividing into blocks will be suggested, depending on the message length: when to divide a message and how many blocks are required. The required number of message blocks will be tested for various in length messages, the throughputs will be calculated to justify the process of message dividing into blocks. The proposed method will tested using various short and long messages, the obtained results will be analyzed to prove the quality, security, sensitivity and the efficiency of the proposed method.