Enhancing image security via chaotic maps, Fibonacci, Tribonacci transformations, and DWT difusion: a robust data encryption approach

In recent years, numerous image encryption schemes have been developed that demonstrate diferent levels of efectiveness in terms of robust security and real-time applications. While a few of them outperform in terms of robust security, others perform well for real-time applications where less processing time is required. Balancing these two aspects poses a challenge, aiming to achieve efcient encryption without compromising security. To address this challenge, the proposed research presents a robust data security approach for encrypting grayscale images, comprising fve key phases. The frst and second phases of the proposed encryption framework are dedicated to the generation of secret keys and the confusion stage, respectively. While the level-1, level-2, and level-2 difusions are performed in phases 3, 4, and 5, respectively, The proposed approach begins with secret key generation using chaotic maps for the initial pixel scrambling in the plaintext image, followed by employing the Fibonacci Transformation (FT) for an additional layer of pixel shufing. To enhance security, Tribonacci Transformation (TT) creates level-1 difusion in the permuted image. Level-2 difusion is introduced to further strengthen the difusion within the plaintext image, which is achieved by decomposing the difused image into eight-bit planes and implementing XOR operations with corresponding bit planes that are extracted from the key image. After that, the discrete wavelet transform (DWT) is employed to develop secondary keys. The DWT frequency subband (high-frequency sub-band) is substituted using the substitution box process. This creates further difusion (level 3 difusion) to make it difcult for an attacker to recover the plaintext image from an encrypted image. Several statistical tests, including mean square error analysis, histogram variance analysis, entropy assessment, peak signal-to-noise ratio evaluation, correlation analysis, key space evaluation, and key sensitivity analysis, demonstrate the efectiveness of the proposed work. The proposed encryption framework achieves signifcant statistical values, with entropy, correlation, energy, and histogram variance values standing at 7.999, 0.0001, 0.0156, and 6458, respectively. These results contribute to its robustness against cyberattacks. Moreover, the processing time of the proposed encryption framework is less than one second, which makes it more suitable for realworld applications. A detailed comparative analysis with the existing methods based on chaos, DWT, Tribonacci transformation (TT), and Fibonacci transformation (FT) reveals that the proposed encryption scheme outperforms the existing ones

Design and Analysis of New Shuffle Encryption Schemes for Multimedia

Securing the contents of visual data and multimedia requires specific design consideration for use in different applications. The major issue with this type of data has been occurrence of redundancy, at various places particularly in images, which makes data values repetitive at several places. The focus of this paper is on design of new shuffling schemes that can efficiently destroy redundancy in the visual data ensuring its secured transmission and distribution over public networks. Different variants of these shuffling schemes will be used as pre-processing schemes on multimedia data values especially in light weight devices using images. Standard as well as chaotic permutation and substitution schemes together with S-box rotation have been used to shuffle and map the plain data into random uncorrelated values via various variants of the presented schemes. For further improving the security, the processed data is encrypted using a computationally fast algorithm in its normal mode of operation. Security analysis using different types of images show that the proposed schemes satisfy the parameters required for securing visual contents even with very high redundancy.Defence Science Journal, 2012, 62(1), pp.159-166, DOI:http://dx.doi.org/10.14429/dsj.62.100

An efficient quantum-classical hybrid algorithm for distorted alphanumeric character identification

An algorithm for image processing is proposed. The proposed algorithm, which can be viewed as a quantum-classical hybrid algorithm, can transform a low-resolution bitonal image of a character from the set of alphanumeric characters (A-Z, 0-9) into a high-resolution image. The quantum part of the proposed algorithm fruitfully utilizes a variant of Grover's search algorithm, known as the fixed point search algorithm. Further, the quantum part of the algorithm is simulated using CQASM and the advantage of the algorithm is established through the complexity analysis. Additional analysis has also revealed that this scheme for optical character recognition (OCR) leads to high confidence value and generally works in a more efficient manner compared to the existing classical, quantum, and hybrid algorithms for a similar task.Comment: A quantum-assisted algorithm for optical character recognition (OCR) is proposed using fixed point Grover's algorith

A novel clock gating approach for the design of low-power linear feedback shift register

This paper presents an efficient solution to reduce the power consumption of the popular linear feedback shift register by exploiting the gated clock approach. The power reduction with respect to other gated clock schemes is obtained by an efficient implementation of the logic gates and properly reducing the number of XOR gates in the feedback network. Transistor level simulations are performed by using standard cells in a 28-nm FD-SOI CMOS technology and a 300-MHz clock. Simulation results show a power reduction with respect to traditional implementations, which reaches values higher than 30%

Chaotic Quantum Encryption to Secure Image Data in Post Quantum Consumer Technology

The rapid advancement in consumer technology has led to an exponential increase in the connected devices, resulting in an enormous and continuous flow of data, particularly the image data. This data needs to be processed, managed, and secured efficiently, especially in the quantum-enabled consumer technology era. This paper, in this regards, presents a quantum image encryption scheme featuring a novel two-phase chaotic confusion-diffusion architecture. The proposed architecture consists of four distinct confusion-diffusion modules that perform a simultaneous qubit and pixel-level encryption on both the position and intensity of quantum encoded pixels. Moreover, quantum circuits for ’qubit-level chaotic transformation’ and ’chaos-based selective perfect shuffle operation’ have been implemented, which collectively enhance the encryption strength of the proposed scheme. Extensive evaluation has been performed based on various statistical security parameters, such as entropy and correlation. When subjected to differential attacks, the proposed scheme proved its resilience exhibiting ideal results of average 99.6% NPCR (Number of Pixels Change Rate) and 33.5% UACI (Unified Average Changing Intensity). Besides, the proposed scheme also demonstrated resilience against occlusion attacks. Tests involving 50% data occlusion from encrypted images validated the proposed scheme’s capability to successfully decrypt the tampered images, recovering maximum information

On the Eigenstructures of Functional K-Potent Matrices and Their Integral Forms

In this paper, a functional k-potent matrix satisfies the equation, where k and r are positive integers, and are real numbers. This class of matrices includes idempotent, Nilpotent, and involutary matrices, and more. It turns out that the matrices in this group are best distinguished by their associated eigen-structures. The spectral properties of the matrices are exploited to construct integral k-potent matrices, which have special roles in digital image encryption