I. Steganography in Text files
The most efficient method of hiding data in text is by using white spaces. The white spaces available to us are tabs and spaces. The data is hidden at the end of each line of the text file. Each line can contain 80 characters. If spaces at the end of one line is not sufficient the control moves to the end of next line. This is repeated until the whole hiding process is completed. The algorithm is formulated in such a way that we use more spaces than tabs, thus eliminating the chance of some editors showing the presence of extra spaces and tabs. This is done for more efficiency. Before hiding data is encrypted with password using the D.E.S encryption algorithm which is discussed later.
Hide algorithm
v Get the data from the encryption module.
v Remove any extra spaces and tabs from the ends of sentences.
v Convert encrypted message/file to bit representation.
v Add zeroes to make it a multiple of 3.
v Encoding is done by taking 3 bits at a time and converting it into spaces equal to its decimal equivalent after putting a tab.
v The above process is done for every 3 bits.
v If line length > 80 go to next line.
v If end of text file is encountered the hiding process is continued at the end of the file.
Unhide algorithm
v Start from the extreme end of each line.
v Go backwards till non-white space character comes.
v Convert number of spaces between tabs to three bit codes.
v Reverse and concatenate bits to get data.
v Do the above for each line until end of file.
v Pass the data to the decryption module.
This is similar to Matthew Kwan's Algorithm.