Welcome to the InfoSci Platform
Hiding Message in Map Along Pre-Hamiltonian Path

Hiding Message in Map Along Pre-Hamiltonian Path

Sunil Kumar Muttoo, Vinay Kumar
Copyright: © 2012 |Pages: 15
ISBN13: 9781466600263|ISBN10: 1466600268|EISBN13: 9781466600270
DOI: 10.4018/978-1-4666-0026-3.ch015
Cite Chapter Cite Chapter

MLA

Muttoo, Sunil Kumar, and Vinay Kumar. "Hiding Message in Map Along Pre-Hamiltonian Path." Optimizing Information Security and Advancing Privacy Assurance: New Technologies, edited by Hamid Nemati, IGI Global, 2012, pp. 255-269. https://doi.org/10.4018/978-1-4666-0026-3.ch015

APA

Muttoo, S. K. & Kumar, V. (2012). Hiding Message in Map Along Pre-Hamiltonian Path. In H. Nemati (Ed.), Optimizing Information Security and Advancing Privacy Assurance: New Technologies (pp. 255-269). IGI Global. https://doi.org/10.4018/978-1-4666-0026-3.ch015

Chicago

Muttoo, Sunil Kumar, and Vinay Kumar. "Hiding Message in Map Along Pre-Hamiltonian Path." In Optimizing Information Security and Advancing Privacy Assurance: New Technologies, edited by Hamid Nemati, 255-269. Hershey, PA: IGI Global, 2012. https://doi.org/10.4018/978-1-4666-0026-3.ch015

Export Reference

Mendeley
Favorite

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.