Skip to main content

Chaos and Pseudo-Randomness

Applications

Part of the Lecture Notes in Control and Information Science book series (LNCIS,volume 292)

Abstract

We discuss the effect on finite machine implementation of chaotic system on randomness. We show that the most significant bit even for fully developed chaotic systems implemented with high precision (using 1000-bit arithmetics) is not random. We propose chaos-based pseudo-random bit generators and discuss their efficient software implementation.

Keywords

  • Chaotic System
  • Turing Machine
  • Binary Expansion
  • True Orbit
  • Congruential Generator

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

About this chapter

Cite this chapter

Kocarev, L., Jakimoski, G., Tasev, Z. Chaos and Pseudo-Randomness. In: Chen, G., Yu, X. (eds) Chaos Control. Lecture Notes in Control and Information Science, vol 292. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44986-7_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-44986-7_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40405-7

  • Online ISBN: 978-3-540-44986-7

  • eBook Packages: Springer Book Archive