Improving random number generators by chaotic iterations. Application in data hiding

Details Improving random number generators by chaotic iterations. Application in data hiding Improving random number generators by chaotic iterations. Application in data hiding

2010-12-21

arxiv.org/abs/1012.4620v1

Computer Science

Cryptography and Security

6 pages, 8 figures, In ICCASM 2010, Int. Conf. on Computer Application and System Modeling, Taiyuan, China, pages ***--***, Oc

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Improving random number generators by chaotic iterations. Application in data hiding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improving random number generators by chaotic iterations. Application in data hiding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improving random number generators by chaotic iterations. Application in data hiding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-95625