一种新的基于伪随机排序表的隐写算法
A Novel Approach of Pseudorandomly sorted list-based Steganography
摘要：
我们提出了一种新的隐写模型的基础上的一系列伪随机排序的字符序列。给定一个$m$列的列表$L$，每个列包含$n$不同的字符串，两取列之间的语义关系很低或没有语义关系，以及一个秘密消息$s \in \{0,1\}^*$，我们的模型通过为$L$的每个列生成一个置换数并根据该数重新排序其中包含的字符串，将$s$逐块嵌入$L$中。其中，令$l$为字符串的平均位长，嵌入容量由$[(m-1)*log_2(n!-1)/n*l]$给出。证明了在满足$(n >> l)$ .实验结果表明，就隐藏容量而言，我们的模型比一些重要的现有方法具有更好的隐藏过程。
英文摘要：
We propose a new model of steganography based on a list of pseudo-randomly sorted sequences of characters. Given a list $L$ of $m$ columns containing $n$ distinct strings each, with low or no semantic relationship between columns taken two by two, and a secret message $s \in \{0,1\}^*$, our model embeds $s$ in $L$ block by block, by generating, for each column of $L$, a permutation number and by reordering strings contained in it according to that number. Where, letting $l$ be average bit length of a string, the embedding capacity is given by $[(m-1)*log_2(n!-1)/n*l]$. We've shown that optimal efficiency of the method can be obtained with the condition that $(n >> l)$. 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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
