Suitability of chaotic iterations schemes using XORshift for security applications

Jacques Bahi (1) , Xiole Fang (1) , Christophe Guyeux (1) , Qianxue Wang (1)

1 FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174)

The design and engineering of original cryptographic solutions is a major concern to provide secure information systems. In a previous study, we have described a generator based on chaotic iterations, which uses the well-known XORshift generator. By doing so, we have improved the statistical performances of XORshift and make it behave chaotically, as defined by Devaney. The speed and security of this former generator have been improved in a second study, to make its usage more relevant in the Internet security context. In this paper, these contributions are summarized and a new version of the generator is introduced. It is based on a new Lookup Table implying a large improvement of speed. A comparison and a security analysis between the XORshift and these three versions of our generator are proposed, and various new statistical results are given. Finally, an application in the information hiding framework is presented, to give an illustrative example of the use of such a generator in the Internet security field.

Domaines: Calcul parallèle, distribué et partagé [cs.DC]; Cryptographie et sécurité [cs.CR]; Modélisation et simulation

Jacques Bahi, Xiole Fang, Christophe Guyeux, Qianxue Wang. Suitability of chaotic iterations schemes using XORshift for security applications. Journal of Network and Computer Applications (JNCA), 2013, 37, pp.282 - 292. ⟨10.1016/j.jnca.2013.03.001⟩. ⟨hal-00932007⟩