Chaotic Map based Random Binary Key Sequence Generation

Abstract

Image encryption is an efficient mechanism by which digital images can be secured during transmission over communication in which key sequence generation plays a vital role. The proposed system consists of stages such as the generation of four chaotic maps, conversion of generated maps to binary vectors, rotation of Linear Feedback Shift Register (LFSR), and selection of generated binary chaotic key sequences from the generated key pool. The novelty of this implementation is to generate binary sequences by selecting from all four chaotic maps viz., Tent, Logistic, Henon, and Arnold Cat map (ACM). LFSR selects chaotic maps to produce random key sequences. Five primitive polynomials of degrees 5, 6, 7, and 8 are considered for the generation of key sequences. Each primitive polynomial generates 61 binary key sequences stored in a binary key pool. All 61 binary key sequences generated are submitted for the NIST and FIPS tests. Performance analysis is carried out of the generated binary key sequences. From the obtained results, it can be concluded that the binary key sequences are random and unpredictable and have a large key space based on the individual and combination of key sequences. Also, the generated binary key sequences can be efficiently utilized for the encryption of digital images.