Cryptography using multiple one-dimensional chaotic maps

Cryptography Using Multiple Two-Dimensional Chaotic Maps

“…Many researches in the field of using chaotic maps in cryptography have been developed [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16]. In [2], a cryptosystem, with a symmetric key block cipher, used an external key of variable length (maximum 128-bits) to generate system parameters and initial conditions of the chaotic map.…”

“…In [4], another chaotic map-based technique was proposed, in which multiple one-dimensional chaotic maps are used instead of a one-dimensional chaotic map. This algorithm uses an external secret key of variable length (maximum 128 bits).…”

“…Two-dimensional chaotic maps are considered and used in this paper, where their behavior is determined by two, instead of one in one-dimensional maps, initial condition variables which change iteratively and randomly according to some map equations and system parameters [4,5]. The 2-D chaotic maps are used in the proposed cryptosystem in order to utilize the high degree of randomization associated with the two variables that are used in the process of encryption, and hence increase confusion and diffusion of the system.…”

Ensemble Of Blowfish With Chaos Based S Box Design For Text And Image Encryption

“…A sign extension bug in one publication of C code has been identified. In 1996, Serge Vaudenay [6] found a known-plaintext attack requiring 2 8r + 1 known plaintexts to break, where r is the number of rounds. Moreover, he also found a class of weak keys that can be detected and broken by the same attack with only 2 4r + 1 known plaintexts.…”

“…Blowfish algorithm [6] requires 521 encryptions of itself to generate the sub keys namely 18 entries in P arrays and 1024 entries in S boxes. The proposed design replaces the 521 encryptions by adapting chaos functions in order to generate highly non linear and key dependant P arrays and S boxes.…”