Hamiltonian graph approach to steganography Online publication date: Mon, 14-Feb-2011
by Sunil Kumar Muttoo, Vinay Kumar
International Journal of Electronic Security and Digital Forensics (IJESDF), Vol. 3, No. 4, 2010
Abstract: A Hamiltonian graph approach is presented in this paper to ensure privacy and secrecy of a crucial secret message that is normally short and precise. A short secret message is treated as stream of bits. Each bit is compared with a functional output of a portion of cover image. The cover is partitioned into as many portions as there are bits in the message. If the bit in the message is equal to the functional output of the corresponding portion of cover, then nothing needs to be done. In case of inequality, a node of graph is created. Then adjacency among nodes is found so that exchange of colour components of pixels according to the direction of traversal in a Hamiltonian cycle makes the functional output of the portion equal to the corresponding bit. Whenever a node is not found to be adjacent to any other node, then the corresponding bit is spread over in the portion in such a way that net effect on the colour components of pixel remains < 0.01. The approach helps in retaining vital statistics of the cover in the stego.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Electronic Security and Digital Forensics (IJESDF):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook