Randomness and disorder of chaotic iterations. Applications in information security field
This work addresses information security challenges by developing chaotic-based cryptographic methods, but it appears incremental as it builds on previous research.
The authors tackled the problem of designing secure chaotic encryption schemes by proposing discrete chaotic iterations that meet Devaney's definition of chaos, and they applied these to pseudorandom number generation, hash functions, and symmetric cryptography with proofs of chaotic properties.
Design and cryptanalysis of chaotic encryption schemes are major concerns to provide secured information systems. Pursuing our previous research works, some well-defined discrete chaotic iterations that satisfy the reputed Devaney's definition of chaos have been proposed. In this article, we summarize these contributions and propose applications in the fields of pseudorandom number generation, hash functions, and symmetric cryptography. For all these applications, the proofs of chaotic properties are outlined.