Capital Shape Alphabet Encoding Based Text Steganography

Capital Shape prototypical rudiment En cryptanalytics Based schoolbookbook SteganographyA Capital Shape Alphabet Encoding ( part) Based school textual matter edition Steganography ApproachAbstractSteganography is the art and science of writing hidden sums in much(prenominal) a way that no maven, apart from the sender and intend recipient, suspects the existence of the put across. Steganography is a form of security through obscurity. Steganography algorithms manipulations loom media such(prenominal) as text, image, audio and video etc. to comprehend the data. User relies on change in the structure of these mediums and features of the target medium in such a manner as is not identifiable by human. In this theme we too present and evaluate my contribution to design the modernistic apostrophize for text Steganography and named it as sequel (Capital Alphabet Shape Encoding) get down. This blast is a combination of random lineament sequence and feature coding method. Keywords- Steganography features encoding decoding blanket text.Steganography means conceal communication. It is derived from a hold up by Johannes Trithemus (1462-1516) titled Steganographia. The word Steganography comes from Greek and essence of steganography is concealed writing. Steganography is apply to transmit a subject through rung innocuous toter i.e. text, image, audio or video over a communication delight in order to effectively conceal the existence of the message. Text steganography is a process to pass over the enigmatical information within text (i.e. division establish) messages. Text steganography is the most problematic kind of steganography 1. Text steganography is considered as difficult unmatchable is due to the lack of redundant information in a text file, while there is a lot of redundancy in a picture or a sound file, which butt end be apply in steganography 1 2.For text steganography there argon m some(prenominal) methods pass around 3 4. Some method change format of text while each(prenominal) method change existing word to hide secret data. smock outer space is used to hide secret data, in open space methods 5, while in syntactic method punctuations ar used to hide secret data 5. In acronyms method 2 and semantic method 4, existent word or phrase replacement is used to hide secret data. By apply characteristics of that particular language data is hidden in Persian/Arabic Text steganography 4 and Hindi Text steganography 6.If we use open space methods 6 or feature coding method 4 in text steganography, and if somehow format of file is changed then(prenominal) it results in data loss. In acronyms and semantic method, meaning of information gouge be changed because these methods use actual word replacement or punctuation to hide secret data. So a method is needed by which secret data defy after changing format of file and meaning of text bequeath not changed.So considering some problems like format changing , changing meaning of secret data, etc. in existing text steganography methods we contrive proposed in the altogether oddball approach for text steganography. We restrain used text features of set up garner to hide secret data. Letters of side first principle based on kind of round shape or ignore, vertical and swimming line are crowded in first approach. Like some earns in English language contains kind of close round shape or curve. Like some garner in English contains sole(prenominal) one nifty vertical line. In second approach, we are assorting tours and symbols. In CASE categorization, based on dissimilar text features of English earn we categorize English letters into octet groups. We have studied the implementation some existing methods mentioned in paper 4 and we have compared these methods with proposed CASE approach. In the proposed CASE approach randomness is used but it aids to provide more security to secret information. For respective(a) existing m ethods and proposed CASE approach we have measured number of bytes hide, succession crash and reposition overhead. Our results delegates that, very less time overhead and memory overhead is required to implement proposed CASE approach compared to existing methods, and also we can hide more number of bytes using proposed approach. Required cover text size is also very modest in proposed approach.In this approach, we introduce invigorated encoding technique to hide the secret message in cover text. We will call this technique Capital Alphabet Shape Encoding (CASE). In this method every character of screen message is encoded in the form of 8- chip shot binary number after that the same ASCII character is replace the legitimate character. In this the left most 0th scrap will represent the alphabet group or frame/symbols group (0 value for alphabet set and 1 value for digit or symbols).In case of alphabet we made eight groups of English letters based on features of letters. W hile making group we consider only Capital letters of English alphabet. The left most 1st, second, 3rd small-arm of 8 act number represents the group number. The next 4th firearm will represent the sentence case of letter. If it is 1, than it represents upper case letter and if its 0 than letter will be lower case letter. put over I, II, III shows eight human action encoding format of alphabets, digits and symbols. In this approach all alphabets are divided into groups and every alphabet has its position in corresponding group. This position will represent the last three check of 8-bit number. By using this approach, we can hide all eight bits of one letter of secret message into one letter of cover text at a time.Table1. 8-Bit encoding format in case of alphabet0th bit1st bit2nd bit3rd bit4th bit5th bit6th bitseventh bitAlphabet(0) throng no.CaseGroup position in alphabet Group.Table2. 8-Bit encoding format in case of digit0th bit1st bit2nd bit3rd bit4th bit5th bit6th bitseve nth bitdigit(1)Group Position in Digit GroupAlways0Always0Always0Table3. 8-Bit encoding format in case of symbols0th bit1st bit2nd bit3rd bit4th bit5th bit6th bit7th bitSymbol(1)Always0Always0Always0Group Position in Symbol Group.As shown in Table1, in first group, we implicate neither those letters which have round shape or any curve and nor vertical and horizontal full-strength line. We can use any letter from this group to hide 000 bit. Candidates for this group are V, W, X, Y. In second group, we include those letters which have one or two vertical straight line. We can use any letter from this group to hide 001 bit. Candidates for this group are K, M and N. In the third group, we include those letters which have only one or more horizontal straight line. We can use any letter from this group to hide 010 bit. Candidates for this group are A and Z. In forth group, we include those letters which have both(prenominal) one and more than one straight vertical and horizontal line. We can use any letter from this group to hide 011 bit. Candidates for this group are E, F, H, I, L and T.In fifth group, we include those group, we include those letters which have only curve or round shape. We can use any letter from this group to hide 100bit. Candidates for this group are C, O, Q, S and U. In sixth group, we include those letters which have both curve and straight vertical line. We can use any letter from this group to hide 101bit. Candidates for this group are B, D, P and R. In seventh group, we include those letters which have curve and straight horizontal line. We can use any letter from this group to hide 110 bit. Candidate for this group is G. In last but not the least eighth group, we include those letters which have curve, and both straight vertical and horizontal line. We can use any letter from this group to hide 111 bit. Candidate for this group is J. For exercise if the secret letter is H then by using CASE approach it will be encoded as 00111010 and i ts ASCII equivalent is 58 which is stipulation by . After encoding, now letter will be mixed up with the cover text. And this letter will hides all the 8 bits of original letter H into cover text.2.1. Hiding the MessageIn the CASE text stenography approach, first we encode all the characters of the secret message with new proposed encoding technique which is based on the shape of the alphabet characters. Second we hide this message with the cover text by flux it with the contents of cover text, i.e. first we encode the secret character and then we perform process of finding the ASCII equivalent of the 8-bit format of the secret character and hide it with the contents of cover text.To hide it or embed it with the cover text, we made a new technique. In this technique we encode the first three letter of the cover text by using CASE approach and then count the bits having value 1. This count value is the place value for hiding the data. After calculating the key value message is m ixed up, one character of message comes after key number character of cover text and this process of embedding are repeated until intact message is hidden in the cover text.For implementation of CASE approach we develop two algorithms for hiding and retrieving which are implemented in JSP using NetBeans IDE.3.1. Pseudo code for message hidingProcedure CASE_steno_hide (String msg, String covertext)begainFor i=0 to msg.length() ch=msg(i) encode_msg=encode_msg+char(encode(ch)) give the axe Forkey_msg=covertext.substring(0,3)For i=0 to key_msg.length()ch=key_msg(i)en_key=en_key+encode(ch)goal Forkeyarray =en_key.toByteArray()key=0For i=0 to keyarray.length()IF keyarrayi == 1 thenkey++End IFEnd ForIF key key=5End IFFor i=0,j=0 to i hidden_msg=hidden_msg+covertext.substring(i,i+k)+encode_msg(j)i=i+k+1j++End For flow hidden_msgEnd Procedure3.2. Pseudo code for message retriveProcedure CASE_steno_unhide(String hidden_msg)begainkey_msg=hidden_msg.substring(0,3)For i=0 to key_msg.length()c h=key_msg(i)en_key=en_key+encode(ch)End Forkeyarray =en_key.toByteArray()key=0For i=0 to keyarray.length()IF keyarrayi == 1 thenkey++End IFEnd ForIF key key=5End IFFor i=key to hidden_msg.length()encode_msg=encode_msg+hidden_msg(i)i=i+keyEnd ForFor i=0 to encode_msg.length()orignal_msg=orignal_msg+decode(encode_msg(i))End Forreturn orignal_msgEnd ProcedureFig. 1 Numbers of bytes hide by particular methodFig. 2 uttermost cover text required to hide 200 bytes and 1000 bytesFig. 3 Time and memory overhead of all methods.In this paper, we have proposed new approach for text-based steganography for English language texts. In this approach, we exploit the shapes of the English characters to hide secret bits. Based on our survey of the existing Text Steganography approaches, we show that our proposed approach can hide more number of bytes, it has very small cover text and required very less time overhead as compare to other techniques. Our analysis reveals that our approach imparts increa sed randomness in encoding because of which the same cannot be attacked easily. This approach is applicable to the soft-copy texts as well as hard-copy texts. In addition, the proposed approach is also immune to retyping and reformatting of text. However, one of the weaknesses of the proposed approach is that once known about their applicability, they can easily be attacked. Hence, it is essential to keep the application of a particular approach to a particular data set secret, while using them. 5. ReferencesM. Shirali-Shahreza, Text steganography by changing words spelling, In 10th outside(a) assembly on Advanced Communication Technology, Korea, 2008.M. Shirali-Shahreza, and M. Shirali-Shahreza, Text Steganography in SMS, In International Conference on Convergence Information Technology, 2007.F. Khan, Enhanced Text Steganography in SMS, In 2nd International Conference on Computer, Control and Communication, 2009.M. Shirali-Shahreza, and M. Shirali-Shahreza, A rising Approach to Persian/Arabic Text Steganography, In 5th IEEE/ACIS International Conference on computer and information science (ICIS COMSAk06), 2006, 310-315.W. Bender, D. Gruhl, N. Morimoto, and A. Lu, Techniques for data hiding, In IBM Systems journal, vol. 35 (Issues 3 4), 1996, p.p.313-336. Available http//www.informatik.unitrier.de/ley/db/ journals/ibmsj/ibmsj35.html.K, Alla, and Dr. R. Shivramprasad, An evolution of Hindi text steganography, In 6th International Conference on Information Technology, 2009.B. Dunbar, A Detailed look at Steganographic techniques and their use in an Open-systems environment, SANS Institute, 2002.K. Bennett, Linguistic Steganography Survey, Analysis, and rigor Concerns for Hiding Information in Text, Purdue University, CERIAS Tech. Report 2004-13, 2004.A. Gutub, and M. Fattani, A Novel Arabic Text Steganography Method Using Letter Points and Extensions, World Academy of Science, plan and Technology, 2007.L. Robert, and T. Shanmugapriya, A Study on Digital Wate rmarking Techniques, In International diary of Recent Trends in Engineering, Vol. 1, No. 2, May 2009.J. Brassil, S. Low, N. Maxemchuk, and L. OGarman, Copyright protection for the electronic distribution of text documents, In Proceedings of the IEEE, VOL. 87, NO. 7, July 1999.J. Brassil, S. Low, N. Maxemchuk, and L. OGorman, electronic marking and identification techniques to discourage document copying Text Steganography, IEEE daybook on Selected Areas in Communications, VOL. 13, NO. 8, October 1995, p.p. 1495-1504.Shraddha Dulera et.al.Experimenting with the Novel Approaches in Text Steganography make on International Journal of Network Security its application (IJNSA), Vol.3, No.6, November 2011, pp 213-225.