Efficient Image Encryption Scheme Using Henon Map, Dynamic S-Boxes and Elliptic Curve Cryptography

Abstract

Image encryption schemes can be vulnerable to a variety of cryptanalysis attacks. The use of key-dependent dynamic S-boxes has been shown to improve security. Threats of chosen-plaintext and chosen-ciphertext attacks still linger. In this paper, we present an efficient algorithm for constructing secure dynamic S-boxes derived from Henon map. We use the proposed dynamic S-box to construct an image encryption scheme that includes a novel combination of security features to resist chosen-plaintext and chosen-ciphertext attacks. Namely, a hash verification step at the end of the decryption procedure effectively thwarts chosen-ciphertext attacks. The hash also serves as an image dependent initialization for the keystream, which together with using an image dependent S-box resist known-plaintext attacks. Furthermore, encryption keys are protected against cryptanalysis using elliptic curve cryptography (ECC).Therefore, the recovery of secret keys is as hard as the elliptic curve discrete logarithm problem even in the unlikely case of the recovery of the temporary S-box or keystream. Our evaluation of the proposed image encryption scheme reveals that it achieves a higher security standard than existing techniques. Moreover, the proposed scheme is computationally efficient with encryption throughput approaching 60 MB/s. INDEX TERMS chaotic map, elliptic curve cryptography, image encryption, substitution box.

A novel multi-image cryptosystem based on weighted plain images and using combined chaotic maps

“…To prove the effectiveness of the proposed method, and to prove why we used Table 2 for different correlation coefficients, Lyapunov's exponent (LE) analysis is employed. Maps with a larger positive Lyapunov exponent have a larger chaotic range [14,31,32]. Here we prove the efficiency of the proposed method for ST (combined of Sine and Tent maps), and there is a similar proof for other combined maps.…”

“…The behavior of the Henon map depends on the value of and b. For a ϵ (0.54, 2), and b ϵ (0, 1), it shows chaotic behavior [30,31]. Due to the fact that this paper uses Henon map for confusion phase and changing the coordinates of the image pixels, so for the N×N image:…”

A Novel Parallelizable Chaotic Image Encryption Scheme Based on Elliptic Curves

“…Several image encryption schemes depend on chaotic masking without scrambling such as [6][7][8][9][10][11]. The scheme proposed in [6] generates a chaotic sequence to XOR with plain image pixels and then applies a dynamic S-box substitution to produce the cipher image.…”

“…The authors introduced an image encryption framework with provable security characteristics by combining chaotic masking and dynamic substitution boxes. Similarly, the work of [11] proposed a secure image encryption scheme based on Henon map because of its high computational speed. However, all chaotic maps used in these works are sequentially computed.…”

“…The generated sequence of random numbers is processed by some algorithm to produce a corresponding bijective S-box. In [11], for instance, the algorithm starts with an initial bijective S-box and uses the generated sequence of pseudorandom numbers to iteratively swap elements of the initial S-box to construct the final S-box. In [10], the algorithm filters repeated numbers out of the sequence to produce a sequence of unique random numbers that represent the final S-box.…”