Efficient Text Data Cryptography using 2D Chaotic Tent Map

Many introduced methods for text data cryptography are suffering from some disadvantages such as: short and fixed length private key, fixed data block size, fixed and big number of rounds, sub keys generation and low throughput. In this research paper a new method of data cryptography process will be introduced, it will be shown that this method will suit cryptography of text messages with any length (short, medium and very long messages. The proposed method will raise the level of security providing a high degree of data protection by using a complicated variable length two dimensional matrix key, this key will be generated based on chaotic tenet map model, the block size and the number of rounds will be included in the chaotic tent map parameters allowing 1D and 2D keys generation. The proposed method will be tested using various text messages, the method throughput will be calculated, and also the messages quality during the encryption and decryption phases will be measured to insure that the proposed method achieves the required cryptography process enhancement. Several type of analysis will be performed to insure achieving the requirements of cryptography: increasing the quality of cryptography, increasing the throughput and increasing the level of security.