Skip to main content

A Pseudo Random Numbers Generator Based on Chaotic Iterations: Application to Watermarking

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6318))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arroyo, D., Alvarez, G., Fernandez, V.: On the inadequacy of the logistic map for cryptographic applications. X Reniun Espaola Sobre Criptologa y Seguirdad de la Informacin (XRECSI) 1, 77–82 (2008)

    Google Scholar 

  2. Bahi, J., Guyeux, C.: A new chaos-based watermarking algorithm. In: SECRYPT 2010, International conference on security and cryptography, Athens, Greece, pp.35-40 (to appear, 2010)

    Google Scholar 

  3. Bahi, J.M., Guyeux, C.: Chaotic iterations and topological chaos. arXiv 0810.3154 (2008)

    Google Scholar 

  4. Cayre, F., Bas, P.: Kerckhoffs-based embedding security classes for woa data hiding. IEEE Transactions on Information Forensics and Security 3(1), 1–15 (2008)

    Article  Google Scholar 

  5. Cecen, S., Demirer, R.M., Bayrak, C.: A new hybrid nonlinear congruential number generator based on higher functional power of logistic maps. Chaos, Solitons and Fractals 42, 847–853 (2009)

    Article  Google Scholar 

  6. Corsaro, S., De Angelis, P.L., Marino, Z., Perla, F., Zanetti, P.: On parallel asset-liability management in life insurance: a forward risk-neutral approach. Parallel Computing (2009)(in Press)

    Google Scholar 

  7. Devaney, R.L.: An Introduction to Chaotic Dynamical Systems, 2nd edn. Addison-Wesley, Reading (1989)

    MATH  Google Scholar 

  8. Guyeux, C., Friot, N., Bahi, J.M.: A more secure information hiding scheme than spread-spectrum obtained by chaos-security. arXiv 0032565 (2010)

    Google Scholar 

  9. Jenkins, R.J.: Isaac. Fast Software Encryption, 41–49 (1996)

    Google Scholar 

  10. Kocarev, L.: Chaos-based cryptography: a brief overview. IEEE Circ Syst Mag 7, 6–21 (2001)

    Article  Google Scholar 

  11. L’ecuyer, P., Simard, R.: Testu01: A software library in ansi c for empirical testing of random number generators. Laboratoire de simulation et doptimisation. Universi de Montral IRO (2009)

    Google Scholar 

  12. Marsaglia, G.: Diehard: a battery of tests of randomness (1996), http://stat.fsu.edu/~geo/diehard.html

  13. Marsaglia, G.: Xorshift rngs. Journal of Statistical Software 8(14), 1–6 (2003)

    Article  Google Scholar 

  14. Po-Han, L., Yi, C., Soo-Chang, P., Yih-Yuh, C.: Evidence of the correlation between positive lyapunov exponents and good chaotic random number sequences. Computer Physics Communications 160, 187–203 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  15. NIST Special Publication 800-22 rev. 1. A statistical test suite for random and pseudorandom number generators for cryptographic applications (August. 2008)

    Google Scholar 

  16. Robert, F.: Discrete Iterations. A Metric Study. Springer Series in Computational Mathematics, vol. 6. Springer, Heidelberg (1986)

    Book  Google Scholar 

  17. Wang, Q., Guyeux, C., Bahi, J.M.: A novel pseudo-random generator based on discrete chaotic iterations for cryptographic applications. In: First International Conference on Evolving Internet (2009)

    Google Scholar 

  18. Wichmanna, B.A., Hillb, I.D.: Generating good pseudo-random numbers. Computational Statistics & Data Analysis 51, 1614–1622 (2006)

    Article  MathSciNet  Google Scholar 

  19. Zheng, F., Tian, X., Song, J., Li, X.: Pseudo-random sequence generator based on the generalized henon map. The Journal of China Universities of Posts and Telecommunications 15(3), 64–68 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guyeux, C., Wang, Q., Bahi, J.M. (2010). A Pseudo Random Numbers Generator Based on Chaotic Iterations: Application to Watermarking. In: Wang, F.L., Gong, Z., Luo, X., Lei, J. (eds) Web Information Systems and Mining. WISM 2010. Lecture Notes in Computer Science, vol 6318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16515-3_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16515-3_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16514-6

  • Online ISBN: 978-3-642-16515-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics