DEA-RTA : A Dynamic Encryption Algorithm for the Real-Time Applications

Abstract

The Internet and it is applications are hungry for high level of Quality of Service (QoS), and most of the Internet applications seek to minimize packets delay, especially, the Real- Time Applications (RTA). QoS is considered as a major issue in the Internet, where RTA services like IPTelephony and XoIP become a successful business in the world, call distribution may result in big money loss, for this reason researchers put their efforts to build applications that can deal with different levels of QoS. In addition to the basic QoS some customers ask to preserve confidentiality which makes it more complicated and may result in higher delay time. Delay is very complex issue specially in RTA, and it consists of many types of delays, such as, Packetization delay (sampling, coder- decoder (codec),compression and encryption), and end-to-end delay (processing, queuing, serialization and propagation delays), our research try to achieve better encryption delay at the user machine CPU level while maintain confidentiality. The proposed algorithm is a new symmetric encryption technique that allows users to choose using new different key for each single packet if they wish. The encryption key is flexible in length, the plain text is flexible in size, the encryption process is very simple, the transposition table is simple too, the shifted transposition table is easy to initiate and complex to regenerate. These properties results in better encryption delay while maintaining confidentiality, the algorithm is 15 times faster and 10 times faster than AES algorithm.