Image Steganography using Polynomials
K. Kanthamma1, K. Maheswari2, G. N. Kodandaramaiah3
1Dr. K. Kanthamma, Associate Professor in Gates Institute of Technology, Gooty (A.P) India.
2K. Maheswari, Associate Processor in Gates Institute of Technology, Gooty (A.P), India.
3Dr. G.N. Kodandaramaiah, Professor in Kuppam Engineering College, KUPPAM, India.
Manuscript received on December 06, 2014. | Revised Manuscript received on December 12, 2014. | Manuscript published on December 15, 2014. | PP: 29-33 | Volume-3 Issue-1, December 2014. | Retrieval Number: A0768123114/2014©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Steganography is the art of hiding secret messages inside other messages as until recently had been the poor cousin of cryptography, to communicate privately in open channel. The disadvantage of cryptography is that cryptanalysis’s will break the secret key and secret message will be revealed .Steganography serves as a better way of securing message than cryptography. Steganography gained importance in the past few years due to the increasing need for providing secrecy in an open environment like internet. Many techniques are used to secure information such as cryptography that aims to scramble the information sent and make it unreadable while steganography is used to conceal the information so that no one can sense its existence. There have been many techniques for hiding messages in images in such a manner that the alterations made to the image are perceptually indiscernible. A new steganography encoding scheme which separates the colour channels of the windows bit map images and then hides the images randomly using polynomials in the LSB of any colour component of choose pixel. The polynomials may be of any type with constants and variables. a new steganographic encoding scheme, randomly hide messages in the LSB of any component of the chosen pixel using polynomial. If polynomial is used, hacker needs to predict more than one number. i.e. all coefficients of polynomial correctly to decode and probability of finding all right coefficients correctly is less compared to predicting single seed as in case random generator. So the strength of the stealth is increased by choosing higher dimensional polynomial.
Keywords: Steganography, messages, cryptography, polynomial, techniques.