Submit Manuscript

Information Technology Journal

Year: 2008 | Volume: 7 | Issue: 3 | Page No.: 450-457
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Article Trend

Total views 101

Authors

Gang Luo

Xingming Sun

Lingyun Xiang

Keywords

Research Article

Multi-Blogs Steganographic Algorithm Based on Directed Hamiltonian Path Selection

Gang Luo, Xingming Sun and Lingyun Xiang
In this research, a steganographic algorithm based on the directed Hamiltonian path selection in the complete digraph mapped from multi-blogs with same article has been proposed. Firstly, we can regard n different blogs referring to a same article as n different virtual vertices and then connect them virtually to construct a complete digraph. As there exist n! different directed Hamiltonian paths at most in a complete digraph with n vertices, after numbering all directed Hamiltonian paths, a large number converted from arbitrary secret information smaller than n! can be expressed as a certain Hamiltonian path. In the process of the actual realization, the cited links of the same article are used to indicate the location of the former vertex of the current in a selected Hamiltonian path. In the information-extracting process, we can recover the whole Hamiltonian path by tracing the cited links and then decode this Hamiltonian path to retrieve the hidden information. Based on the theoretical analysis and the experimental proof, it demonstrates that the proposed steganography has good imperceptibility and security.
PDF Fulltext XML References Citation

Leave a Comment

Your email address will not be published. Required fields are marked *