Improving random number generators by chaotic iterations Application in data hiding
In this paper, a new pseudo-random number generator (PRNG) based on chaotic iterations is proposed. This method also combines the digits of two XORshifts PRNGs. The statistical properties of this new generator are improved: the generated sequences can pass all the DieHARD statistical test suite. In addition, this generator behaves chaotically, as defined by Devaney. This makes our generator suitable for cryptographic applications. An illustration in the field of data hiding is presented and the robustness of the obtained data hiding algorithm against attacks is evaluated.
topological chaos pseudo-random number generator statistical tests internet security data hiding discrete chaotic iterations
Christophe Guyeux Qianxue Wang Jacques M.Bahi
University of Franche-Comte Computer Science Laboratory LIFC, Besancon, France
国际会议
太原
英文
643-648
2010-10-22（万方平台首次上网日期，不代表论文的发表时间）