A fast ARX model-based image encryption scheme

Abstract

This paper proposes a novel ARX model-based image encryption scheme that uses addition, rotation, and XOR as its confusion and diffusion mechanism instead of S-Box and permutation as in SP networks. The confusion property of the proposed scheme is satisfied by rotation and XOR with chaotic sequences generated from two logistic maps. Unlike classical image encryption schemes that adopt S-Box or permutation of the entire plain image, the diffusion property is satisfied using addition operations. The proposed scheme exhibits good performance on correlation coefficients (horizontal, vertical and diagonal), Shannon's entropy and NPCR (Number of Pixels Change Rate). Furthermore, simulation results indicate that its time complexity is 9.2 times more efficient than the fastest algorithm(Yang's algorithm).

A parallel image encryption algorithm based on the piecewise linear chaotic map and hyper-chaotic map

“…In terms of the key space, it should be larger than 2 100 to defend from a brute force attack [9]. The key space of this work is larger than Ref [1,8,31,44,47], but smaller than the scheme in [10]. However the NPCR and UACI values in Ref [10] are smaller.…”

“…However the NPCR and UACI values in Ref [10] are smaller. In addition, the proposed algorithm is faster than [1,10,31,44,47], but slower than [8]. Although the algorithm in the approach of [8] only takes 3.41ms for encryption, however this time is only for one round encryption.…”

“…In addition, the proposed algorithm is faster than [1,10,31,44,47], but slower than [8]. Although the algorithm in the approach of [8] only takes 3.41ms for encryption, however this time is only for one round encryption. The histograms showed that the algorithm in [8] is not safe if using only one round encryption, therefore it normally needs more than six rounds to get a good security performance which takes a long time to complete all these steps.…”

“…Although the algorithm in the approach of [8] only takes 3.41ms for encryption, however this time is only for one round encryption. The histograms showed that the algorithm in [8] is not safe if using only one round encryption, therefore it normally needs more than six rounds to get a good security performance which takes a long time to complete all these steps. Table 8 demonstrates that the proposed parallel image encryption algorithm can achieve a fast encryption speed and also a secure system performance.…”

LEA 192: High Speed Architecture of Lightweight Block Cipher

“…The communication among connected things must be secure and fast while processing confidential data. Due to a substantial amount of sensitive and valuable data and low computational resources in the network, it has become cumbersome to provide security in the IoT [2]. Resource-constrained applications comprising of sensor nodes in wireless sensor networks, RFID tags require smaller footprint with minimum battery consumption.…”