Abstract
The 8-queens problem of placing 8 non-attacking queens on an 8x8 chessboard is used to hide message in an image. The method helps in randomizing the bit selection in a cover image for hiding purpose. Cover image is divided into blocks of 8x1 bytes and then masked with solutions of the 8-queens problem. Bits from the block are collected corresponding to the 8-queen solution to make a 7 bit string. LSB of the block is not considered. It gives a number in the range of 0 to 127. If a bit string, corresponding to the 8-queens solutions, matches with ASCII code of the first character from message, the corresponding solution number of the 8-queens problem is encrypted using RC4, and the cipher is stored in first block of the cover. This encrypted value works as key. The solution number corresponding to next character is XORED with the key and the resultant value is embedded in the LSB of next block. The algorithm has been tested with cover of different image file formats like BMP, PNG and TIFF. The algorithm provides very good capacity, imperceptibility and robustness.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Information Security and Privacy
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
