IDEAS home Printed from https://ideas.repec.org/a/igg/jisp00/v6y2012i4p55-70.html
   My bibliography  Save this article

Secure Data Hiding Using Eight Queens Solutions

Author

Listed:
  • Sunil Kumar Muttoo

    (Department of Computer Science, University of Delhi, New Delhi, India)

  • Vinay Kumar

    (Department of IT, Vivekanand Institute of Professional Studies, New Delhi, India)

  • Abhishek Bansal

    (Department of Computer Science, Indira Gandhi National Tribal University, Amarkantak, India)

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.

Suggested Citation

  • Sunil Kumar Muttoo & Vinay Kumar & Abhishek Bansal, 2012. "Secure Data Hiding Using Eight Queens Solutions," International Journal of Information Security and Privacy (IJISP), IGI Global, vol. 6(4), pages 55-70, October.
    • Handle: RePEc:igg:jisp00:v:6:y:2012:i:4:p:55-70
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jisp.2012100103
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jisp00:v:6:y:2012:i:4:p:55-70. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.