Image Steganography Based On Non Linear Chaotic Algorithm

S.Allwin Devaraj et al., International Journal of Advanced Research in Innovative Discoveries in Engineering and Applications[IJARIDEA] Vol.2, Issue 2,27 April 2017, pg. 1-8

Image Steganography Based On Non Linear Chaotic Algorithm S.Allwin Devaraj1, Blanie Scrimshaw William2 2

¹Assistant Professor, Department of ECE, Francis Xavier Engineering College, Tirunelveli, India Assistant Professor, Department of CSE, St. Mother Theresa Engineering College, Vagaikulam, India

Abstract— Late inquires about of picture steganography have been progressively in light of clamorous frameworks, yet the disadvantages of little key space and powerless security in one-dimensional disorderly cryptosystems are self-evident. This paper presents steganography with nonlinear riotous calculation (NCA) which utilizes control capacity and digression work rather than straight capacity. Its basic parameters are acquired by test examination. The message with the key is then consolidated with the cover picture utilizing LSB installing and discrete cosine change.

Keywords— Discrete Cosine Transform, LSB Embedding, Nonlinear Chaotic Algorithm, Steganography, Stego Image.

I. INTRODUCTION

Steganography is gotten from the Greek word steganos which actually signifies "secured" and graphia which signifies "composing", i.e. secured composing. Steganography frequently draws disarray with cryptography regarding appearance and utilization [1], [2]. The most huge contrast amongst steganography and cryptography is the doubt calculate [3], [4]. Truth be told, when both cryptography and steganography are being actualized together, an adequate measure of security could be achieved.This sort of technique is utilized to make the nearness of a mystery information seem undetectable to spies, for example, key lumberjacks or hurtful following treats. Data burglary by malware has been generally used to catch client's secret key and classified information with a specific end goal to utilize it for seizing individual ownership particularly falsifying or adulteration of Mastercards and recognizable proof cards [5].

In this paper, a JPEG picture will be picked as a cover medium and the message data utilized is of a similar configuration [6], [7]. The Stego-Image is the last item after a mystery message is installed in the cover question. The mystery message will be disguised in a coverpicture by applying the non clamorous calculation to create a stego-picture. LSB inserting is utilized for hiding the message.

© 2017, IJARIDEA All Rights Reserved

1

S.Allwin Devaraj et al., International Journal of Advanced Research in Innovative Discoveries in Engineering and Applications[IJARIDEA] Vol.2, Issue 2,27 April 2017, pg. 1-8

II. OVERVIEW OF THE PROPOSED SCHEME

Fig. 1. Block Diagram

An easy way to comply with the conference paper formatting requirements is to use this document as a template and simply type your text into it.

A. LSB Embedding

Slightest huge piece inclusion is a typical, basic way to deal with install data in a cover document. The LSB is the most reduced request bit in a double esteem. Generally, three bits from every pixel can be put away to conceal a picture in the LSBs of every byte of a 24-bit picture. Therefore, LSB requires that lone portion of the bits in a picture be changed when information can be covered up in slightest and second minimum huge bits but then the subsequent stego-picture which will be shown is indistinct to the cover picture to the human visual framework.

Š 2017, IJARIDEA All Rights Reserved

2

S.Allwin Devaraj et al., International Journal of Advanced Research in Innovative Discoveries in Engineering and Applications[IJARIDEA] Vol.2, Issue 2,27 April 2017, pg. 1-8

Fig. 2. LSB Bit is indicated

The last piece of the byte is chosen as the minimum noteworthy piece In bit expansion, the slightest critical piece has the helpful property of changing quickly if the number changes marginally. For instance, if 1 (parallel 00000001) is added to 3 (twofold 00000011), the outcome will be 4 (double 00000100) and three of the slightest noteworthy bits will change (011 to 100).

Fig. 3.(i)LSB value to be inserted (ii) Original LSB value (iii)Added bit value

The last piece of the byte is chosen as the minimum noteworthy piece In bit expansion, the slightest critical piece has the helpful property of changing quickly if the number changes marginally. For instance, if 1 (parallel 00000001) is added to 3 (twofold 00000011), the outcome will be 4 (double 00000100) and three of the slightest noteworthy bits will change (011 to 100).

B. Discrete Cosine Transform

The discrete cosine transform (DCT) is closely related to the discrete Fourier transform. It is a separable linear transformation; that is, the two-dimensional transform is equivalent to a one-dimensional DCT performed along a single dimension followed by a one-dimensional DCT in the other dimension. The definition of the two- dimensional DCT for an input image A and output image B is

Where M and N are the line and segment size of An, individually. On the off chance that you apply the DCT to genuine information, the outcome is additionally genuine. The DCT Š 2017, IJARIDEA All Rights Reserved

3

S.Allwin Devaraj et al., International Journal of Advanced Research in Innovative Discoveries in Engineering and Applications[IJARIDEA] Vol.2, Issue 2,27 April 2017, pg. 1-8

tends to think data, making it helpful for picture pressure applications. This change can be rearranged utilizing idct2.

The DCT is utilized to change a flag from the spatial space into the recurrence area. The turn around process that of changing a flag from the recurrence area into the spatial space, is known as the Inverse Discrete Cosine Transform (IDCT).

A flag in the recurrence area contains an indistinguishable data from that in the spatial space. The request of qualities got by applying the DCT is unintentionally from most minimal to most astounding recurrence.

C. Advantage of DCT Vitality Compaction:

Adequacy of a change plan can be specifically gaged by its capacity to pack enter information into as couple of coefficients as could reasonably be expected. This permits the quantizer to dispose of coefficients with moderately little amplitudes without presenting visual contortion in the recreated picture. DCT shows magnificent vitality compaction for exceptionally associated pictures.

Decorrelation:

The rule preferred standpoint of picture change is the expulsion of repetition between neighboring pixels. This prompts uncorrelated change coefficients which can be encoded autonomously. Consequently, it can be derived that DCT shows fabulous decorrelation properties.

D. Logistic Map Analysis

The NCA security is far much superior to some other old little key methods that existed.

The disentangling of the data utilizing the ideal key just uncovers the mystery information, then again unraveling with the wrong key outcomes just sand grain picture. In this venture we have managed the picture inserting strategy and the data safety efforts that secures or mystery information correspondence. As referred to Logistic guide is characterized as: xn+1 = k • xn • (1 _ xn), where k 2 (0, 4), n = 0,1,. . The parameter k and starting quality x0 may speak to the key. The parameter k can be separated into three sections, which can be inspected by analyses on taking after conditions: x0 = 0.3. At the point when k 2 (0, 3) the figuring comes about go to a similar incentive after a few emphasess with no disorderly conduct. At the point when k 2 [3, 3.6), the stage space finishes up a few focuses just, the framework shows up periodicity.

While k 2 [3.6, 4), it turns into a disordered framework with periodicity vanished. So we can make the accompanying determinations: (1) The Logistic guide does not fulfill uniform appropriation property. At the point when k 2 [0, 3.6) the focuses focus on a few values and couldn't be utilized for encryption reason. (2) Cryptosystems in view of Logistic guide has little key space and feeble security. [9] proposed a principle in which the division is the urgent stage in iris acknowledgment. We have utilized the worldwide limit an incentive for division. In the above calculation we have not considered the eyelid and eyelashes relics, which corrupt the execution of iris acknowledgment framework. The framework gives sufficient execution likewise the outcomes are attractive.

© 2017, IJARIDEA All Rights Reserved

4

S.Allwin Devaraj et al., International Journal of Advanced Research in Innovative Discoveries in Engineering and Applications[IJARIDEA] Vol.2, Issue 2,27 April 2017, pg. 1-8

Fig. 4. Image encryption and decryption experimental result: (a) plain-image, (b) encrypted image, (c) decrypted image by correct key,(d) decrypted image by wrong key.

III. EXPERIMENTAL RESULTS

Fig. 5.Message image

Fig. 6.2nd DCT

© 2017, IJARIDEA All Rights Reserved

5

S.Allwin Devaraj et al., International Journal of Advanced Research in Innovative Discoveries in Engineering and Applications[IJARIDEA] Vol.2, Issue 2,27 April 2017, pg. 1-8

Fig. 7.Encrypted image

Fig. 8.Cover Image

Fig. 9.Stego Image

Fig. 10.Restored Image

© 2017, IJARIDEA All Rights Reserved

6

S.Allwin Devaraj et al., International Journal of Advanced Research in Innovative Discoveries in Engineering and Applications[IJARIDEA] Vol.2, Issue 2,27 April 2017, pg. 1-8

Fig. 11.2nd IDCT

Fig.12.Reconstructed Image

IV. CONCLUSION

Causal Productions has used its best efforts to ensure that the templates have the same appearance. With the expansion of the way to the message picture i.e. scrambling the message picture utilizing a private key builds the data security thus the opportunity to be hacked or taped is diminished. Since the data security is expanded mystery information correspondence is made conceivable. It is especially reasonable for Internet picture encryption and transmission applications. Despite the fact that the calculation exhibited in this paper goes for the picture encryption, it is not recently constrained to this range and can be generally connected in other data security fields.

[1] [2] [3] [4]

[5]

[6] [7]

REFERENCES J. Fridrich, T. Pevny, and J. Kodovsky, “Statistically Undetectable JPEG Steganography: Dead Ends,Challenges, and Opportunities", ACM MM&S Workshop, Dallas, TX, pp. 3-14, 2007.

M. Mahdavi, S. Samavi, V. Sabeti, “Transform domain steganography using random blocking foruncompressed images”, 4th Iranian Society of Cryptology Conference, 2007 (Persian).

V. Sabeti, S. Samavi, M. Mahdavi, S. Shirani, "Steganalysis of Pixel-Value Differencing Steganographic Method,” Proceedings of IEEE Pacific Rim conference, pp. 292-295, Canada, 2007.

J. Fridrich, M. Goljan and R. Du, “Steganalysis Based on JPEG Compatibility”, Special session on Theoreticaland Practical Issues in Digital Watermarking and Data Hiding, SPIE Multimedia Systems and Applications IV, Denver, CO, pp. 275-280, 2001.

R.E. Newman, I.S. Moskowitz, LiWu Chang, and M.M. Brahmadesam, “A steganographic embedding undetectable by JPEG-compatibility steganalysis”, Information Hiding, 5th International Workshop, Springer, New York, Vol. 2578 pp. 258-277, 2002.

K. Solanki, A. Sarkar, and B.S. Manjunath. “YASS: Yet another steganographic scheme that resists blind Steganalysis”, Information Hiding, 9th International Workshop, Springer-Verlag, France, 2007.

R.E. Newman, I.S. Moskowitz, LiWu Chang, and M.M. Brahmadesam. “A steganographic embedding undetectable by JPEG-compatibility steganalysis”. In F.A.P. Petitcolas, editor, Information Hiding, 5th

© 2017, IJARIDEA All Rights Reserved

7

S.Allwin Devaraj et al., International Journal of Advanced Research in Innovative Discoveries in Engineering and Applications[IJARIDEA] Vol.2, Issue 2,27 April 2017, pg. 1-8

[8] [9]

[10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20]

International Workshop, Vol. 2578 of Lecture Notes in Computer Science, pages 258-277. Springer, NewYork.

M. Ramkumar, and A.N. Akansu, “Capacity estimatesfor data hiding in compressed images”, IEEE Transaction on Image Processing, Vol. 10, pp. 1252-1263, 2001 Christo Ananth,"Iris Recognition Using Active Contours",International Journal of Advanced Research in Innovative Discoveries in Engineering and Applications[IJARIDEA],Volume 2,Issue 1,February 2017,pp:27-32.

J. Fridrich, M. Goljan and D. Hogea, “steganalysis of JPEG images: breaking the F5 algorithm”, Lecture notes in computer scince, Springer, New York, Vol. 2578, pp 310-232. 2003.

Chen GR, Mao YB, et al. A symmetric image encryption scheme based on 3D chaotic cat maps. Chaos, Solitons & Fractals 2004;21:749–61.

Kocarev L. Chaos-based cryptography: a brief overview. IEEE Circ Syst 2001;1:6–21.

Sobhy MI, Shehata AR. Methods of attacking chaotic encryption and countermeasures. IEEE Acoust Speech Signal Process 2001:1001–4.

Chiaraluce F, Ciccarelli L, et al. A new chaotic algorithm for video encryption. IEEE Trans Consum Electron 2002;48:838–43.

Matthews R. On the derivation of a chaotic encryption algorithm. Cryptologia 1989;13:29–42.

Zhang LH, Liao XF, Wang XB. An image encryption approach based on chaotic maps. Chaos, Solitons & Fractals2005;24:759–65.

Wu XG, Hu HP, Zhang BL. Analyzing and improving a chaotic encryption method. Chaos, Solitons & Fractals 2004;22:367–73.

Li S, Mou X. Improving security of a chaotic encryption approach. Phys Lett A 2001;290:127–33.

Jakimoski G, Kocarev L. Analysis of some recently proposed chaos-based encryption algorithms. Phys Lett A 2001;291:381–4.

Wang YW, Guan ZH, Wen XJ. Adaptive synchronization for Chen chaotic system with fully unknown parameters. Solitons & Fractals 2004;19:899–903.

© 2017, IJARIDEA All Rights Reserved

8