1 research outputs found
A Novel Approach of Pseudorandomly sorted list-based Steganography
We propose a new model of steganography based on a list of pseudo-randomly
sorted sequences of characters. Given a list of columns containing
distinct strings each, with low or no semantic relationship between columns
taken two by two, and a secret message , our model embeds
in block by block, by generating, for each column of , a permutation
number and by reordering strings contained in it according to that number.
Where, letting be average bit length of a string, the embedding capacity is
given by . We've shown that optimal efficiency of the
method can be obtained with the condition that . The results which
has been obtained by experiments, show that our model performs a better hiding
process than some of the important existing methods, in terms of hiding
capacity.Comment: 35 pages, 1 figure, 15 table