2000 character limit reached
A Pseudo Random Numbers Generator Based on Chaotic Iterations. Application to Watermarking (1012.4626v1)
Published 21 Dec 2010 in cs.CR and nlin.CD
Abstract: In this paper, a new chaotic pseudo-random number generator (PRNG) is proposed. It combines the well-known ISAAC and XORshift generators with chaotic iterations. This PRNG possesses important properties of topological chaos and can successfully pass NIST and TestU01 batteries of tests. This makes our generator suitable for information security applications like cryptography. As an illustrative example, an application in the field of watermarking is presented.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.