Using B+ Tree To Represent Secret Messages For Steganography Purpose


In this research we suggest a new approach by using B+ tree for storing the secret massages (that want to be sent) in a manner that prevent redundancy of these massages or even sub massages in order to provide efficient memory usage . The proposed system includes two stages: Stores the secret message and get its unique code by using B+ tree, and retrieves the unique secret message when we have its code by using B+ tree. The proposed system was implemented using Visual Prolog5.1 and after testing, the proposed system gives an efficient time in storing and in retrieving the secret messages, also the proposed method solved the ambiguity problem that some steganography methods suffer from.