Double Secure algorithm for Text Steganography

Abstract

Steganography is a technique to conceal the existence of secret information except for the sender and receiver. Researchers have used different algorithms in the field of Steganography to provide safe communication through the network, but still, there is a possibility to circumvent the standard security. Most of the algorithms are using one layer of security. This paper is introducing a double secure algorithm having two layers of security by combining the best features of capital alphabet shape encoding algorithms ( Chaudhary et al., 2013) and hiding data in paragraphs (Agarwal, 2013). We have removed the zero and 1 index problem for symbols and digits in the CASE algorithm at 4bit position; therefore, we call it a modified CASE algorithm. The new algorithm overcomes its limitations as the CASE algorithm has a security issue that if someone knew about its applicability, then it can effortlessly be detected and the hiding data in paragraphs also has ascii coding for text steganography. Unicode is standardized while ASCII isn’t, therefore DSTS use UTF-16 for text steganography The results demonstrate that the proposed technique is more secure and robust than its ancestors.