Chaotic Lightweight Cryptosystem for Image Encryption. (24th May 2021)

• Record Type: Journal Article
• Authors: Ferdush, Jannatul; Begum, Mahbuba; Uddin, Mohammad Shorif
• Other Names: Seeling Patrick Academic Editor.
• Is Part Of: Advances in multimedia. Volume 2021(2021)
• Publication Date: 2021-05-24
• Subjects: Multimedia systems -- Periodicals; Computer networks -- Periodicals; Multimédia; Réseaux d'ordinateurs; Computer networks; Multimedia systems; Periodicals; 006.7
• DOI: 10.1155/2021/5527295
• Languages: English
• ISSNs: 1687-5680

Abstract

Abstract : Data transmission over the Internet and the personal network has been risen day by day due to the advancement of multimedia technology. Hence, it is today's prime concern to protect the data from unauthorized access and encrypt the multimedia element as they are stored on the web servers and transmitted over the networks. Therefore, multimedia data encryption is essential. But, the multimedia encryption algorithm is complex to implement as it requires more time and memory space. For this reason, the lightweight image encryption algorithm gains popularity that requires less memory and less time along with low power or energy and provides supreme security for limited devices. In this study, we have studied the chaotic-based lightweight image encryption method. At first, we have presented a standard framework and algorithm based on two chaotic maps such as Arnold and logistic for lightweight image encryption and performed some experiments. We have analyzed different groups of images such as miscellaneous, medical, underwater, and texture. Experimentations have provided the largest entropy 7.9920 for medical image (chest X-ray), large key space 2 m×m×8, and average encryption and decryption times are 3.9771 s and 3.1447 s, respectively. Besides, we have found an equal distribution of pixels and less correlation coefficients among adjacent pixels of the encrypted image. These criteria indicate an efficient image encryption method. Also, our method is efficient and less complex than the existing state-of-the-art methods.