An innovative image encryption algorithm enhanced with the Pan-Tompkins Algorithm for optimal security

The widespread use of images, especially color images and rapid advancement of computer science, have led to an emphasis on securing these images and defending them against intruders. One of the most popular ways to protect images is to use encryption algorithms that convert data in a way that is not recognized by someone other than the intended user. The Advanced Encryption Standard algorithm (AES) is one of the most protected encryption algorithms. However, due to various types of theoretical and practical assaults, like a statistical attack, differential analysis, and brute force attack, its security is under attack.
 In this paper, a modified AES coined as (M-AES) is proposed to improve the efficiency of the AES algorithm by increasing the algorithm's security to make the algorithm more suitable for color image encryption, and make it more resistant to many attacks. The modification is conducted on ShiftRows transformation of the original AES algorithm. To test the efficiency of the proposed M-AES algorithm, several images are drawn from the Signal and Image Processing Institute's (SIPI) image dataset. Moreover, the Mean Square Error (MSE), Peak Signal-to-Noise Ratio (PSNR), Entropy (H), Correlation Coefficient (CC), visual evaluation of histogram, Number of Pixels Change Rate (NPCR) and Unified Average Changing Intensity (UACI) are used as an evaluation metric. The results show that proposed modification to the AES algorithm makes the algorithm more appropriate to image and surpasses the original AES. 
 The modification is conducted on ShiftRows step of the original AES algorithm. To test the efficiency of the proposed M-AES algorithm, several images are drawn from the signal and image processing institute's (SIPI) image dataset. Moreover, the mean square error (MSE), peak signal-to-noise ratio (PSNR), entropy (H), correlation coefficient (CC), visual evaluation of histogram, number of pixels change rate (NPCR) and unified average changing intensity (UACI) are used as an evaluation metrics. The results show that the suggested modification to AES makes it's more appropriate to the image and surpasses the original AES.

The present scenario of the medical field is that sending the healthcare images through the internet is so far exposed to security threats. Hence, there is a need for an efficient and secure procedure to exchange healthcare images over the Internet. The Digital Image and Communication in Medicine (DICOM) provides security features for image header information but not for the pixel information. Hence to send the pixel information in a highly secured manner, the pixels need to be encrypted by using a suitable encryption algorithm. The number of pixel changing rate (NPCR) and the unified averaged changed intensity (UACI) are well-known encryption evaluation metrics to analyse the differential attack in image encryption. These two values are used to calculate the average number of pixel changes and intensity changes between two encrypted images before and after modifying any one pixel in a plaintext image respectively. If these two values are high, then the image encryption can resist the differential attacks. In this paper, a theoretical value of NPCR and UACI are computed for DICOM image encryption concerning different significant levels. An encryption algorithm with Gould transform, RC5, logistic map and DNA Diffusion is proposed for DICOM image to increase the NPCR, and UACI value and this method offered an efficient security strategy for DICOM pixel information. Finally, the computed theoretical value of NPCR and UACI are compared with the existing and proposed algorithm.

Aiming at the problem of digital image encryption, an image encryption algorithm is proposed. The algorithm is divided into preparation stage and permutation diffusion stage. In the preparation stage, Arnold algorithm is improved and combined with Logistic chaotic map to generate the necessary sequence for the next stage. In the permutation diffusion stage, the final encrypted image is obtained by permutation, positive XOR operation, shift operation, S-box substitution and reverse XOR operation. The experimental results show that the algorithm can effectively resist the common attacks. For the 128 × 128 Lena gray image, the resistance performance number of pixel change rate (NPCR) is 99.6090, unified average changing intensity (UACI) is 33.4316. In addition, the time consumption of the algorithm is about 0.0055 s, and the experiments show that the algorithm has high security and real-time performance.

Secure image transmission is one of the most challenging problems in the age of communication technology. Millions of people use and transfer images for either personal or commercial purposes over the internet. One way of achieving secure image transmission over the network is encryption techniques that convert the original image into a non-understandable or scrambled form, called a cipher image, so that even if the attacker gets access to the cipher they would not be able to retrieve the original image. In this study, chaos-based image encryption and block cipher techniques are implemented and analyzed for image encryption. Arnold cat map in combination with a logistic map are used as native chaotic and hybrid chaotic approaches respectively whereas advanced encryption standard (AES) is used as a block cipher approach. The chaotic and AES methods are applied to encrypt images and are subjected to measures of different performance parameters such as peak signal to noise ratio (PSNR), number of pixels change rate (NPCR), unified average changing intensity (UACI), and histogram and computation time analysis to measure the strength of each algorithm. The results show that the hybrid chaotic map has better NPCR and UACI values which makes it more robust to differential attacks or chosen plain text attacks. The Arnold cat map is computationally efficient in comparison to the other two approaches. However, AES has a lower PSNR value (7.53 to 11.93) and has more variation between histograms of original and cipher images, thereby indicating that it is more resistant to statistical attacks than the other two approaches.

ABSTRACTRecently, in chaotic cryptography several new techniques have been suggested to develop efficient and secure image encryption algorithm for communication of image over insecure/public channels. Some of these techniques are computationally less complex but fails to provide sufficient security, and some techniques are though highly secured but increases computational overhead for encryption and decryption. This paper presents an efficient bit-plane encryption algorithm using chaotic, quadratic, and cubic maps. The proposed algorithm is based on the confusion, diffusion, and pixel randomisation processes. The encryption security of this technique for different bit-plane has been tested through key space analysis, statistical analysis, entropy analysis, and sensitivity analysis for real time image encryption and transmission. The presented algorithm shows the strength of security in terms of information entropy, peak signal-to-noise ratio (PSNR), number of pixels change rate (NPCR), unified average changing intensity (UACI), and correlation coefficient with the number of encrypted bit planes. It is clear that the strength of security increases with the number of encrypted bit planes, but the presented results demand that the level of security reached to the requirements (expected theoretically according to [C. Fu, et al., Optic Express, 20, 2363–78, Jan. 2012]) after encryption of four to six bit planes with reasonable small encryption/decryption time. This features proved the novelty of the proposed work. The algorithm is tested by the random and pseudo-random sequence of test standard SP 8000-22 released by National Institute of Standard and Technology Commission (NIST).

A wrist-based photoplethysmography (PPG) tool offers a simple and non-invasive approach for applications in vital sign monitoring and healthcare. However, in a telecare network, these physiological signals ensure the authorisation demands for the domain of medical applications. Hence, this study proposes an intelligent method for PPG signal encryption and decryption. This method combines chaotic map and radial basis function network (RBFN) into symmetric cryptography with an adaptive scheme. The sine-power chaotic map is used as a key generator of 256 non-ordered numbers (key space) to set the private cipher codes. Two RBFNs are used to train an encryptor and a decryptor with the authorised cipher codes. Its substitution-based infosecurity scheme can change the numerical values of PPG raw data for each encrypted communication, and the decrypted PPG data are further applied for time- and frequency-domain analyses in clinical applications, such as heart and respiration rate analysis and arterial stiffness and upper extremity vascular disease evaluations. Through experimental results, the security levels are validated using the number of pixel change rate (NPCR), unified averaged changed intensity (UACI), and correlation analysis. The average NPCR, UACI, and correlation coefficient (CC) are 96.57%, 35.43%, and 0.005, respectively, between the plain PPG and the encrypted PPG data against hacker attacks. The larger-the-better of NPCR and UACI indexes and the smaller-the-better of CC index are obtained to evaluate the efficiency of the proposed cryptography method. The encrypted PPG also guarantees physiological signals of good quality in clinical applications. In addition, the performance of RBFN-based method is superior in adaptive learning capability than that of the traditional learning method in real-time applications.

In the last decade, the communication of images through the internet has increased. Due to the growing demands for data transfer through images, protection of data and safe communication is very important. For this purpose, many encryption techniques have been designed and developed. New and secured encryption schemes based on chaos theory have introduced methods for secure as well as fast communication. A modified image encryption process is proposed in this work with chaotic maps and orthogonal matrix in Hill cipher. Image encryption involves three phases. In the first phase, a chaotic Henon map is used for permuting the digital image. In the second phase, a Hill cipher is used whose encryption key is generated by an orthogonal matrix which further is produced from the equation of the plane. In the third phase, a sequence is generated by a chaotic tent map which is later XORed. Chaotic maps play an important role in the encryption process. To deal with the issues of fast and highly secured image processing, the prominent properties of non-periodical movement and non-convergence of chaotic theory play an important role. The proposed scheme is resistant to different attacks on the cipher image. Different tests have been applied to evaluate the proposed technique. The results of the tests such as key space analysis, key sensitivity analysis, and information entropy, histogram correlation of the adjacent pixels, number of pixel change rate (NPCR), peak signal to noise ratio (PSNR), and unified average changing intensity (UCAI) showed that our proposed scheme is an efficient encryption technique. The proposed approach is also compared with some state-of-the-art image encryption techniques. In the view of statistical analysis, we claim that our proposed encryption algorithm is secured.

The majority of imaging techniques use symmetric and asymmetric cryptography algorithms to encrypt digital media. Most of the research works contributed in the literature focus primarily on the Advanced Encryption Standard (AES) algorithm for encryption and decryption. This paper propose an analysis for performing image encryption and decryption by hybridization of Elliptic Curve Cryptography (ECC) with Hill Cipher (HC), ECC with Advanced Encryption Standard (AES) and ElGamal with Double Playfair Cipher (DPC). This analysis is based on the following parameters: (i) Encryption and decryption time, (ii) entropy of encrypted image, (iii) loss in intensity of the decrypted image, (iv) Peak Signal to Noise Ratio (PSNR), (v) Number of Pixels Change Rate (NPCR), and (vi) Unified Average Changing Intensity (UACI). The hybrid process involves the speed and ease of implementation from symmetric algorithms, as well as improved security from asymmetric algorithms. ECC and ElGamal cryptosystems provide asymmetric key cryptography, while HC, AES, and DPC are symmetric key algorithms. ECC with AES are perfect for remote or private communications with smaller image sizes based on the amount of time needed for encryption and decryption. The metric measurement with test cases finds that ECC and HC have a good overall solution for image encryption.

The usage of multimedia data has grown exponentially over the past few decades, with a significant portion of its content in the form of images and videos, which are transmitted across various public networks. As the prevalence of video content continues to rise, so does the critical need for enhanced data security. Recently, several techniques have been proposed to create efficient data security procedures, focusing on security, robustness and computational complexity. This paper proposes a secure and robust video encryption technique based on the concepts of confusion and diffusion. During the confusion phase, horizontal and vertical permutations of pixel values are performed using a permutation box and then pixel values are substituted based on a lookup table. In the diffusion phase, the pixel values of the first frame are XORed with a defined box, and then, sequentially, the pixel values in the remaining frames are XORed using the previous frame as a reference. Each stage requires keys for processing that are generated by three different chaotic logistic maps, which successfully passed the NIST test. These numbers are then XORed to implement a multi‐chaotic logistic map effectively. Simulation metrics, including entropy, correlation, NPCR, UACI, and so forth demonstrate the strength of the proposed method. The result analysis also states that the proposed methodology performs well in terms of Quantitative Security Analysis Correlation Analysis 0.0017, Entropy Analysis 7.99, Peak Signal to Noise Ratio 7.898, Mean Square Error 10549.37, Structural Similarity Index (0.0075), Key Space Analysis (), Differential Attack Analysis (Number of Pixel Change Rate 99.61 and Unified Average Change Intensity 33.46), Robustness Analysis (Salt and Paper Noise (pass), Gaussian Noise (pass), Occlusion Attack (pass) and Execution Time Analysis θ ( n )).

The security of information and digital images has become a major issue during the last three decades. A large number of algorithms for data and image encryptions are reported in the literature. However, many of the proposed algorithms are not suitable in the fields of application, because they are cryptographically weak. In the present work, a novel algorithm for encoding digital images by using a circle map with 3 parameters has been proposed. In this article different images are used for testing the validity of the proposed algorithm. The algorithm has increased the strength of security of the image encryption against cipher-text-only, chosen-plaintext and chosen-cipher-text attacks. The analysis of cryptographic strength has also been performed to confirm the fact. The results of several experimental tests, such as, key space analysis, key sensitivity analysis and statistical analysis show that the proposed algorithm for image cryptosystems provides an efficient and secure way for image encryption. A comparison in terms of correlation between the initial and transformed images, number of pixels change rate (NPCR) and unified average changing intensity (UACI) is also done. Keywords: Circle map, Chaos, Lyapunov exponent, anti-differential attack, NPCR, UACI.

Agricultural IoT sensors face dual challenges of severe resource constraints and emerging quantum computing threats. Existing encryption schemes either lack quantum resistance or impose excessive computational overhead that is unsuitable for battery-powered field devices. We propose a Dynamic Quantum-Resistant Selective Encryption (DQRSE) scheme that combines the 2D DiscreteWavelet Transform (2D-DWT) with NIST-standardized post-quantum cryptography. The approach selectively encrypts the LL2 sub-band using AES-256-GCM, while protecting high-frequency sub-bands using HMAC-SHA256. ML-KEM-1024 provides quantum-resistant key encapsulation, and ML-DSA ensures authenticated signatures. A novel content-adaptive key rotation mechanism triggers new key generation when Frobenius-norm image differences exceed threshold τ , balancing security against efficiency. Evaluation in the CottonWeedID15 dataset (5,187 agricultural images) demonstrates key selection diversity of 7.88 bits/byte (dynamic) vs 3.32 bits / byte (static), Number of pixels change rate (NPCR) 99.6%, unified average change intensity (UACI) 33.4%, encrypted pixel correlation coefficient <0.005 and minimal computational overhead compared to static approaches 3.32 bits / byte (key selection diversity). DQRSE represents the first quantum-resistant dynamic selective encryption specifically optimized for agricultural sensor networks. Performance evaluation conducted on Debian VMs (4GB RAM, 4 cores) represents idealized lower bounds; the target ARM Cortex-M agricultural sensors (<256KB RAM, 48-168 MHz) will exhibit 25 × higher latency and energy consumption. Future work includes hardware validation on embedded platforms.

RC6 is considered one of the encryption strategies being utilized and modified to be suited for image protection. However, the RC6 encryption algorithm is still prone to statistical and differential attack which is one of the major concerns whenever open networks are to be used. In this paper, we proposed a modification of RC6 algorithm for image encryption. A new technique of permutation-diffusion architecture based on a modified concept of cyclic shift is integrated to increase the degree of permutation and diffusion mechanism of RC6 for image encryption. The security level, processing time and diffusion rate were tested using image evaluation metrics such as correlation coefficient test, number of pixel change rate (NPCR) test, unified average change intensity (UACI) test, and run-time analysis to measure its efficiency along with the simulation process. Results show that the proposed method illustrates a lower value of correlation among pixels and higher value of NPCR and UACI which makes the proposed method highly resistant to statistical and differential attacks. Increased security level with minimal time consumption is achieved in our approach.

A sweeping computational ghost imaging (SCGI)-based encryption system is intended for increased data security and speedier data transport. SCGI is combined with steganography and cryptography processes in this system. SCGI requires fewer shots, resulting in faster image capture, transmission, encryption, and decryption. This strategy also results in smaller, more compact data packages and higher bitrates. Least significant bit (LSB) uses steganography to conceal the hidden picture. In the case of Rivest–Shamir–Adleman (RSA) encryption, public and private keys are generated via a one-way function based on bucket values. Encryption is performed on two levels, with an asymmetric approach divided into three sub-items that significantly increase encryption. Surprisingly, the method uses fewer pictures for image reconstruction, resulting in faster image reconstruction. SCGI promises applications in an extensive number of data encryption sectors since this technology leads to smaller data packages and higher bitrates. The presented approach is examined using the number of pixel change rate (NPCR), normalized root mean square (NRMS), peak signal-to-noise ratio (PSNR), and correlation coefficient (CC), which indicates constant encryption improvement. We experimentally and situationally demonstrate our findings under eavesdropping, which prove the resistance and robustness of our methods. In optimal settings, this innovation enhances encryption by up to 90% when compared to traditional encryption methods.

Medical images are regarded as important and sensitive data in the medical informatics systems. For transferring medical images over an insecure network, developing a secure encryption algorithm is necessary. Among the three main properties of security services (i.e., confidentiality, integrity, and availability), the confidentiality is the most essential feature for exchanging medical images among physicians. The Goldreich Goldwasser Halevi (GGH) algorithm can be a good choice for encrypting medical images as both the algorithm and sensitive data are represented by numeric matrices. Additionally, the GGH algorithm does not increase the size of the image and hence, its complexity will remain as simple as O(n2). However, one of the disadvantages of using the GGH algorithm is the Chosen Cipher Text attack. In our strategy, this shortcoming of GGH algorithm has been taken in to consideration and has been improved by applying the padding (i.e., snail tour XORing), before the GGH encryption process. For evaluating their performances, three measurement criteria are considered including (i) Number of Pixels Change Rate (NPCR), (ii) Unified Average Changing Intensity (UACI), and (iii) Avalanche effect. The results on three different sizes of images showed that padding GGH approach has improved UACI, NPCR, and Avalanche by almost 100%, 35%, and 45%, respectively, in comparison to the standard GGH algorithm. Also, the outcomes will make the padding GGH resist against the cipher text, the chosen cipher text, and the statistical attacks. Furthermore, increasing the avalanche effect of more than 50% is a promising achievement in comparison to the increased complexities of the proposed method in terms of encryption and decryption processes.

In this paper, a cryptosystem is proposed to encrypt 16-bit monochrome DICOM image using enhanced chaotic economic map. A new enhanced chaotic economic map (ECEM) is designed from the chaotic economic map which has better bifurcation nature and positive Lyapunov exponent values. In order to improve the sternness of the encryption algorithm, the enhanced chaotic map is employed to generate the pixel permutation, masking, and swapping sequences. The substitution operation is introduced in-between the standard permutation and diffusion operations. The robustness of the proposed image encryption algorithm is measured by various analyses such as histogram, key sensitivity, key space, number of pixel change rate (NPCR), unified average change intensity (UACI), information entropy and correlation coefficient. The results of the security analyses are compared with existing algorithms to validate that the proposed algorithm is better in terms of larger key space to resist brute force attacks and other common attacks on encryption.