Chaos and cryptography: block encryption ciphers based on chaotic maps

By G. Jakimoski, Ljupco Kocarev. 2001

693 citations recorded by the source corpus.

How researchers see this paper

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

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.”
Chaos-based cryptography: a brief overview (2001, result): “An attempt only to mention all related papers on chaos and cryptography in this short presentation will result in a prohibitively long list; and, therefore, we refer the reader to some recent work [2].”
On the Dynamical Degradation of Digital Piecewise Linear Chaotic Maps (2005, methodology): “…the dynamics of Type-I discretized chaotic systems, due to the non-invertible combination of F and G. Note that the quantization function G is also used in the definitions of some Type- II discretized chaotic systems [Jakimoski & Kocarev, 2001; Kocarev & Jakimoski, 2001; Masuda & Aihara, 2002a,b].”