Data Hiding Scheme using 14 Squares Substitution Cipher & Index Variable  
  Authors : Milind Deshkar; P.S.Kulkarni


In this paper we are proposing a technique for hiding the important data using the technique of cryptography and steganography. Firstly, we encrypt the data using the proposed substitution cipher algorithm, and then embed the cipher text in the carrier image. At a single point of time, we will be using only 2-bit combination. This method first finds the total bytes of the data that has to be hidden. The selection of the bit position of the carrier image depends on the value of an index variable. Here the 6th bit means the LSB minus two locations, the 7th bit means the LSB minus one location and 8th bit means the least significant bit (LSB) location. The index value will change from 0 to 1 or 1 to 2 or 2 to 0 after each embedding. Before sending the embedded image the data is locked with a security id. Due to the security lock and the image bytes which depend on the size of the cipher text, this method is a stronger approach.


Published In : IJCAT Journal Volume 1, Issue 6

Date of Publication : 31 July 2014

Pages : 308 - 311

Figures :--

Tables : --

Publication Link : Data Hiding Scheme using 14 Squares Substitution Cipher & Index Variable




Milind S. Deshkar : Qualification : M.Tech(CSE) Pursuing Deapartment: CSE College: RCERT, Chandrapur

P. S. Kulkarni : Qualification : M.Tech, PhD.(Pursuing) Deapartment: IT College: RCERT, Chandrapur











Fourteen square cipher

index variable

The carrier image is transformed into binary form. Each pixel becomes 1 byte. The cipher text of the secret message is converted into bytes. Now calculate the number of bytes, suppose it is n. Divide it by 2, say it is x. The x called as the index variable. The value x=0, corresponds to 6th and 7th bit locations, x=1 corresponds to 7th and 8th bit locations, of any pixel (byte) of the digital image. If present value of x=0 hide the two bits of cipher text in 6th and 7th bit locations of the present pixel (byte), and next value of x is 1 for the next pixel. If present value of x=1 hide the two bits of cipher text in 7th and 8th bit locations of the present pixel (byte), and next value of x is 0 for the next pixel. After embedding the text to the carrier image, the security id is entered. This security id is sent through communication to the receiver. This security id is needed in the reverse process to extract the secret message.










[1] Gandharba Swain and Saroj Kumar Lenka, “Steganography Using the Twelve Square Substitution Cipher and an Index Variable”, 3rd IEEE International Conference on Electronics Computer Technology (ICECT),Vol.3, Pg. No. 84-88/2011

[2] Po-Yueh Chen and Hung-Ju Lin, “A DWT Based Approach for Image Steganography”, International Journal of Applied Science and Engineering Vol. 4, No. 3: Pg. no. 275-290 / 2006

[3] Mohammad Ali Bani Younes and Aman Jantan , “A New Steganography Approach for Image Encryption Exchange by Using the Least Significant Bit Insertion”, IJCSNS International Journal of Computer Science and Network Security, Vol.8 No.6/ June 2008

[4] Mohammed Abbas Fadhil Al-Husainy, “A New Image Steganography Based on Decimal-Digits Representation”, Computer and Information Science Journal, Vol. 4, No. 6/ November 2011

[5] R.S. Gutte, Y.D. Chincholkar and P.U. Lahane, “STEGANOGRAPHY FOR TWO AND THREE LSBs USING EXTENDED SUBSTITUTION ALGORITHM”, ICTACT Journal on Communication Technology, Vol.04, Issue. 01/ March 2013

[6] Rosziati Ibrahim and Teoh Suk Kuan, “ Steganography Algorithm to Hide Secret Message inside an Image”, Computer Technology and Application Vol. 2 pp. 102-108

[7] H. Rifa-Pous and J. Rifa, “Product Perfect Codes and Steganography”, Digital Signal Processing, Vol.19, 2009, pp. 764-769.

[8] Joachim J. Eggers, R.Bauml and Bernd Girod,“ A Communications Approach to image steganography”, Proc. of SPIE Volume 4675, San Jose, Ca, 2002, pp. 1- 12.

[9] Iwata, M., Miyake, K., and Shiozaki, A. , “Digital Steganography Utilizing Features of JPEG Images”,IEICE Transfusion Fundamentals, E87-A, 4:929-936/ 2004.

[10] A. Sinha, K. Singh, "A technique for image encryption using digital signature", Optics Communications, vol.218, no. 4, 2003, pp.229-234.

[11] EE. Kisik Chang, J. Changho, L. Sangjin, "High Quality Perceptual Steganographic Techniques,", Springer, Vol. 2939, 2004, pp.518-531.

[12] G. C. Kessler, "Steganography: Hiding Data Within Data," Windows & .NET Magazine/ September 2001.

[13] Alvaro Martin, Guillermo Sapiro, & GadielSeroussi,”Is Steganography Natural”, IEEE Transactions on Image Processing, 14(12), 2040-2050/ 2005

[14] P.Mohan Kumar, & D.Roopa, “An Image Steganography Framework with Improved Tamper Proofing”, Asian Journal of Information Technology, 6(10), 1023-1029. ISSN: 1682-3915/ 2007

[15] Hardik J. Patel and Preeti K. Dave, “Least Significant Bits Based Steganography Technique”, International Journal of Electronics Communication and Computer Engineering (IJECCE) pp.44-50/ 2012

[16] Ross J. Anderson and Fabian A.P. Petitcolas, “On The Limits of steganography”, IEEE Journal of selected Areas in communication, Vol.16, No.4, pp. 474-481/ 1998.

[17] Y. K. Jain and R. R. Ahirwal, “A Novel Image Steganography Method with Adaptive Number of Least Significant Bits Modification Based on Private Stego Keys”, International Journal of Computer Science and Security, vol. 4, no. 1, pp. 40-49/,2010

[18] M. Juneja and P. S. Sandhu, “Designing of Robust Steganography Technique Based on LSB Insertion and Encryption”, Proceedings of International Conference on Advances in Recent Technologies in Communication and Computing, pp. 302-305/ , 2009