Chaos-based cryptography: a brief overview

By Ljupco Kocarev. 2001

903 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/12dd8412cb70aecf3aa3227d668865280bd4c49a

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

In Computer Vision and Pattern Recognition

In Mathematical Physics

Citations in the corpus

A 3 - D Novel Conservative Chaotic System and its Generalized Projective Synchronization via Adaptive Control (2015, background): “The synchronization of chaotic systems has applications in secure communications [91-93], cryptosystems [94, 95], encryption [96, 99], etc.”
A Novel Fast Image Encryption Scheme Based on 3D Chaotic Baker Maps (2004, methodology): “…applications of bulk data encryption, which make use of two special features of chaotic maps — the sensitivity to initial conditions and parameters and the mixing property (topological transitivity or ergodicity), [Fridrich, 1998; Kocarev, 2001; Kocarev & Jakimovski, 2001; Masuda & Aihara, 2002].”
A fast color image encryption algorithm based on coupled two-dimensional piecewise chaotic map (2012, background): “Although one-dimensional chaotic maps are advantageous considering the high-level efficiency and simplicity aspects [28], but most existing chaotic cryptosystems still suffer from fundamental drawbacks such as small key space, slow performance speed and weak security function [29].”
A novel algorithm for image encryption based on mixture of chaotic maps (2008, background): “On the other hand, various cryptanalysis have exposed some inherent drawbacks of chaotic cryptosystems [18–21].”
A new chaotic algorithm for image encryption (2006, background): “57], b 2 [3,15] fxng n1⁄40 is chaotic sequence a = 1.”
Security of public-key cryptosystems based on Chebyshev polynomials (2004, background): “Chaotic systems are indeed characterized by sensitive dependence on initial conditions and similarity to random behavior, properties which seem pretty much the same required by several cryptographic primitives (see [20] for a brief overview).”
Some Basic Cryptographic Requirements for Chaos-Based Cryptosystems (2003, methodology): “The nonlinearity of the encryption function f is measured using the linear approximation probability ( LP f ), deﬁned as (see [Jakimoski & Kocarev, 2001]): where a and b are two bit masks, and • denotes the parity of bit-wise product.”
A symmetric image encryption scheme based on 3D chaotic cat maps (2004, background): “It has been proved that in many aspects chaotic maps have analogous but different characteristics as compared with conventional encryption algorithms [8,9,12,13].”