Capital Shape Alphabet Encoding Based Text Steganography

Capital Shape Alphabet Encoding Based Text Steganography A Capital Shape Alphabet Encoding (CASE) Based Text Steganography Approach Dynamic Steganography is the workmanship and study of composing shrouded messages so that nobody, aside from the sender and expected beneficiary, associates the presence with the message. Steganography is a type of security through lack of definition. Steganography calculations utilizes spread media, for example, text, picture, sound and video and so forth to shroud the information. Client depends on change in the structure of these mediums and highlights of the objective medium in such a way as isn't recognizable by human. In this paper we additionally present and assess my commitment to structure the new methodology for text Steganography and named it as CASE (Capital Alphabet Shape Encoding) approach. This methodology is a mix of arbitrary character succession and highlight coding strategy. Watchwords Steganography; highlights; encoding; disentangling; spread content. Steganography implies disguise correspondence. It is gotten from a work by Johannes Trithemus (1462-1516) named Steganographia. The word Steganography originates from Greek and significance of steganography is hidden composition. Steganography is utilized to transmit a message through some harmless transporter for example text, picture, sound or video over a correspondence divert so as to adequately cover the presence of the message. Text steganography is a procedure to shroud the mystery data inside content (for example character based) messages. Text steganography is the most troublesome sort of steganography [1]. Text steganography is considered as troublesome one is because of the absence of excess data in a book document, while there is a great deal of repetition in an image or a sound record, which can be utilized in steganography [1] [2]. For text steganography there are numerous techniques accessible [3] [4]. Some technique change organization of text while some strategy change genuine word to conceal mystery information. Void area is utilized to conceal mystery information, in open space strategies [5], while in syntactic strategy accentuations are utilized to shroud mystery information [5]. In abbreviations strategy [2] and semantic technique [4], genuine word or expression substitution is utilized to shroud mystery information. By utilizing qualities of that specific language information is covered up in Persian/Arabic Text steganography [4] and Hindi Text steganography [6]. In the event that we utilize open space techniques [6] or highlight coding strategy [4] in text steganography, and on the off chance that some way or another configuration of record is changed, at that point it brings about information misfortune. In abbreviations and semantic strategy, which means of data can be changed on the grounds that these strategies utilize real word substitution or accentuation to conceal mystery information. So a strategy is required by which mystery information make due in the wake of changing organization of record and importance of text won't changed. So considering a few issues like arrangement changing, changing significance of mystery information, and so on in existing content steganography techniques; we have proposed new CASE approach for text steganography. We have utilized content highlights of English letters to shroud mystery information. Letters of English letters in order dependent on sort of round shape or bend, vertical and even line are assembled in first methodology. Like a few letters in English language contains sort of close round shape or bend. Like a few letters in English contains just a single consecutive vertical line. In second methodology, we are gathering numbers and images. In CASE order, in light of various content highlights of English letters we sort English letters into eight gatherings. We have examined the usage some current strategies referenced in paper [4] and we have contrasted these techniques and proposed CASE approach. In the proposed CASE approach arbitrariness is utilized yet it helps to g ive greater security to mystery data. For different existing techniques and proposed CASE approach we have estimated number of bytes cover up, time overhead and memory overhead. Our outcomes shows that, extremely less time overhead and memory overhead is required to actualize proposed CASE approach contrasted with existing techniques, and furthermore we can conceal increasingly number of bytes utilizing proposed approach. Required spread content size is likewise little in proposed approach. In this methodology, we acquaint new encoding procedure with conceal the mystery message in spread content. We will call this strategy Capital Alphabet Shape Encoding (CASE). In this strategy each character of discharge message is encoded as 8-piece parallel number after that the equal ASCII character is supplant the first character. In this the left most 0th piece will speak to the letters in order gathering or digit/images gathering (0 incentive for letter set and 1 incentive for digit or images). In the event of letters in order we made eight gatherings of English letters dependent on highlights of letters. While making bunch we think about just Capital letters of English letter set. The left generally first, second, third piece of 8 piece number speaks to the gathering number. The following fourth piece will speak to the sentence instance of letter. In the event that it is 1, than it speaks to capitalized letter and if its 0 than letter will be lower case letter. Table I, II, III shows eight piece encoding arrangement of letter sets, digits and images. In this methodology all letters in order are partitioned into gatherings and each letter set has its situation in comparing gathering. This position will speak to the last three piece of 8-piece number. By utilizing this methodology, we can shroud every one of the eight bits of one letter of mystery message into each letter of spread content in turn. Table1. 8-Bit encoding position if there should be an occurrence of letters in order 0th piece first piece second piece third piece fourth piece fifth piece sixth piece seventh piece Letters in order (0) Gathering no. Case Gathering position in letters in order Group. Table2. 8-Bit encoding design if there should be an occurrence of digit 0th piece first piece second piece third piece fourth piece fifth piece sixth piece seventh piece digit (1) Gathering Position in Digit Group Continuously 0 Continuously 0 Continuously 0 Table3. 8-Bit encoding position in the event of images 0th piece first piece second piece third piece fourth piece fifth piece sixth piece seventh piece Image (1) Continuously 0 Continuously 0 Continuously 0 Gathering Position in Symbol Group. As appeared in Table1, in first gathering, we incorporate neither those letters which have round shape or any bend and nor vertical and flat straight line. We can utilize any letter from this gathering to conceal 000 piece. Possibility for this gathering are V, W, X, Y. In second gathering, we incorporate those letters which have a couple of vertical straight line. We can utilize any letter from this gathering to shroud 001 piece. Contender for this gathering are K, M and N. In the third gathering, we incorporate those letters which have just at least one level straight line. We can utilize any letter from this gathering to conceal 010 piece. Contender for this gathering are An and Z. In forward gathering, we incorporate those letters which have both one and more than one straight vertical and flat line. We can utilize any letter from this gathering to shroud 011 piece. Contender for this gathering are E, F, H, I, L and T. In fifth gathering, we incorporate those gathering, we incorporate those letters which have just bend or round shape. We can utilize any letter from this gathering to conceal 100bit. Possibility for this gathering are C, O, Q, S and U. In 6th gathering, we incorporate those letters which have both bend and straight vertical line. We can utilize any letter from this gathering to conceal 101bit. Possibility for this gathering are B, D, P and R. In seventh gathering, we incorporate those letters which have bend and straight flat line. We can utilize any letter from this gathering to shroud 110 piece. Possibility for this gathering is G. In last yet not the least eighth gathering, we incorporate those letters which have bend, and both straight vertical and level line. We can utilize any letter from this gathering to shroud 111 piece. Possibility for this gathering is J. For instance in the event that the mystery letter is H, at that point by utilizing CASE approach it will be encoded as 00111010 and its ASCII proportional is 58 which is given by :. In the wake of encoding, presently letter : will be stirred up with the spread content. What's more, this letter will conceals all the 8 bits of unique letter H into spread content. 2.1. Concealing the Message In the CASE text transcription approach, first we encode all the characters of the mystery message with new proposed encoding procedure which depends on the state of the letters in order characters. Second we conceal this message with the spread content by blending it in with the substance of spread content, for example first we encode the mystery character and afterward we perform procedure of finding what could be compared to the 8-piece arrangement of the mystery character and shroud it with the substance of spread content. To conceal it or implant it with the spread content, we made another method. In this method we encode the initial three letter of the spread content by utilizing CASE approach and afterward tally the bits having esteem 1. This tally esteem is the key an incentive for concealing the information. In the wake of computing the key worth message is stirred up, one character of message comes after key number character of spread content and this procedure of implanting are rehashed until entire message is covered up in the spread content. For usage of CASE approach we create two calculations for covering up and recovering which are executed in JSP utilizing NetBeans IDE. 3.1. Pseudo code for message stowing away Method CASE_steno_hide (String msg, String covertext) begain; For i=0 to msg.length() ch=msg(i); encode_msg=encode_msg+char(encode(ch)); End For key_msg=covertext.substring(0,3); For i=0 to key_msg.length() ch=key_msg(i); en_key=en_key+encode(ch); End For keyarray []=en_key.toByteArray(); key=0; For i=0 to keyarray.length() In the event that keyarray[i] == 1, at that point key++; End IF End For In the event that key key=5; End IF For i=0,j=0 to I hidden_msg=hidden_msg+covertext.substring(i,i+k)+encode_msg(j); i=i+k+1; j++; End For return hidden_msg; End Procedure 3.2. Pseudo code for message retrive Method CASE_steno_unhide(String hidden_msg) begain key_msg=hidden_msg.substring(0,3); For i=0 to key_msg.length() ch=key_msg(i); en_key=en_key+encode(ch); End For keyarray []=en_key.toByteArray(); key=0; For i=0 to keyarra