An enhanced D-Shuffle Sorting algorithm for secured encryption message to represent in tree

Generally, in encryption or decryption processes the standard algorithms DES (Data Encryption Standard) and AES (Advanced Encryption Standard) to be used for text message transmission. These standards seem not to be enough secure and as fast for the problem of message communication. Already we had proposed a new technique to encrypt the text message by sorting technique. That paper was focusing a safe mechanism for secured message passing to tackle the security problem of information by using Bubble Sort technique to encrypt and decrypt the text message. In this paper, we propose an efficient encryption algorithm by an enhanced D-Shuffle Sorting technique. The basic idea of this paper is to increase the security level, much simpler to implement and improve the efficiency by replacing the Bubble sort technique with an enhanced D-Shuffle Sorting Technique to encrypt and decrypt the text message. The encrypted message can be represented in a balanced tree format, which transmits over the network; gives much strengthen the security for the safest communication. To ensure the performance of an enhanced algorithm requires n - 1 passes, is compared to D-Shuffle algorithm required n passes to encrypt.