Improving random number generators by chaotic iterations application in data hiding

Author

Guyeux, Christophe ; Wang, Qianxue ; Bahi, Jacques M.

Author_Institution

Comput. Sci. Lab. LIFC, Univ. of Franche-Comte, Besançon, France

Volume

13

fYear

2010

fDate

22-24 Oct. 2010

Abstract

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.

Keywords

cryptography; data encapsulation; random number generation; DieHARD statistical test suite; XORshifts PRNG; chaotic iterations; cryptographic applications; data hiding; pseudo-random number generator; Authentication; Cryptography; DNA; Generators; Discrete chaotic iterations; Internet security; Pseudo-random number generator; Statistical tests; Topological chaos; data hiding;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Application and System Modeling (ICCASM), 2010 International Conference on

Conference_Location

Taiyuan

Print_ISBN

978-1-4244-7235-2

Electronic_ISBN

978-1-4244-7237-6

Type

conf

DOI

10.1109/ICCASM.2010.5622199

Filename

5622199