Emergent Mind
Randomness and disorder of chaotic iterations. Applications in information security field
(1611.08422)
Published Nov 25, 2016
in
nlin.CD
and
cs.CR
Abstract
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.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.