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

Hiding Message in Map Along Pre-Hamiltonian Path

Author

Listed:
  • Sunil Kumar Muttoo

    (University of Delhi, India)

  • Vinay Kumar

    (National Informatics Centre, India)

Abstract

In this paper, an algorithm to embed information in a map along Hamiltonian path is presented. A file based data structure in which a graph is treated as a composition of three components, node, segment and intermediate points that constitute a segment, is used to store a graph. In a map with N nodes, each node can represent ?log2N? bits from message bit strings. Any bits (= 0) from message between bit strings represented by adjacent nodes are embedded in a segment. In the case of a multi graph, a segment is selected based on the last two bits in the nodes. A pre Hamiltonian path is determined in the map starting from node represented by the first ?log2N? bits from message string to the last bit string ?log2N?. The method is tested on different maps and messages of different sizes and robust results have been observed. Retrieval is based on the key (S, |m|, ?) and traversing along the pre Hamiltonian path starting from node S.

Suggested Citation

  • Sunil Kumar Muttoo & Vinay Kumar, 2010. "Hiding Message in Map Along Pre-Hamiltonian Path," International Journal of Information Security and Privacy (IJISP), IGI Global, vol. 4(4), pages 21-34, October.
    • Handle: RePEc:igg:jisp00:v:4:y:2010:i:4:p:21-34
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jisp.2010100102
    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:4:y:2010:i:4:p:21-34. 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.