An improved two-dimensional image encryption algorithm using Huffman coding and hash function along with chaotic key generation

• Main Authors: Sekar, Jai Ganesh, Arun, C., Rushitha, S., Bhuvaneswari, B., Sowmya, C. Sri, Prasuna, N. Sai
• Format: Conference Proceeding
• Language: English
• Subjects: Data encryption; Data transmission; Encryption; Hash based algorithms; Huffman codes; Multimedia
• ISSN: 0094-243X; 1551-7616
• DOI: 10.1063/5.0114663

Several picture encryption techniques have been developed in recent years. This work proposes a supported and advanced encryption technology and encryption, 2D encryption picture encryption method on paper. The sha-256 method removes picture components first, then generates a replacement key that matches the user’s key before inserting the original image. For every grey image size, we enable rows and columns in the same order by the same members created by the Logistic map. We determine the beginning values and parameters of complicated maps using the sha-256 hash of a clear image, making an important change in all encryptions without modifying the standard keys. Finally, the method is used to recover the encrypted picture. The system can accomplish good encryption results and security standards, according to test findings and security analyses. Data transmission over the Internet and personal networks has risen day by day as multimedia technology has advanced. As a result, today’s main focus is safeguarding data from unauthorised access and encrypting multimedia elements as they are stored on web servers and sent over networks. As a result, data encryption for multimedia is necessary. The multimedia encryption approach, on the other hand, is difficult to apply since it requires more time and memory.