Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International journal of advance research and innovative ideas in education

PERFORMANCE OF QUANTUM BASED IMAGE SCRAMBLING CRYPTOGRAPHY USING QPQ-CD ON 5G NETWORK AUTHENTIFICATION KEY AGREEMENT

Rakotondramanana Radiarisainana Sitraka, Randriamitantsoa Paul Auguste

Published Jan 1, 2019• 0 citations
OpenAlex

Abstract

The QPQ-CD (Quantum and PostQuantum CipherKey Dynamic uses a dynamic key after the registration of the mobile at the 5G Network. The algorithm could be divided in two parts : The Quantum Cryptography and Post Quantum Cryptography. The Quantum Cryptography used Quantum Image Scrambling methods with the Red, Green, and Blue Component which are treated separately by the two algorithms QAT and QHT. They change only the position of the image pixel without changing the value of this. QAT and QHT use 2 method different : one is based on the permutation of the pixel position and the others is based on one the space-filling curveIn this article, the performance of the Quantum Cryptography using at the QPQ-CD is analyzed by the PSNR(Peak Signal to Noise Ratio), SSIM (Structural SIMilarity), NPCR(Number of Pixel exchange rate), UACI (Unified Average Changing Intensity), Correlation and the binary entropy. PSNR for the two methods is near than the value 8 which is a good visual quality visualThe SSIM and Correlation also offers a best parameter which is near zero. The image transformed by scrambling methods and originals are no similitude and no correlation. The NPCR give also a good performance because 99% of pixels changed in the image. But the UACI is not more than 20%. So, the intensity light of the new image doesn’t change with the maximum. The algorithm of the scrambling is not resistant to the attack physic using difference power analysis. The binary entropy is less than 50%. There are quite no disorder between the bits one and bit zeros. The QPQ-CD with evaluation of the Quantum Cryptography is simulated to Matlab and all curve for this is represented in this article. The QAT and QHT have quite a similar performance.

Related papers

PERFORMANCE OF OPTIMIZED POST- QUANTUM HASH BASED CRYPTOGRAPHY USING QPQ-CD ON 5G NETWORK AUTHENTICATION KEY AGREEMENT

Rakotondramanana Radiarisainana Sitraka, Randriamitantsoa Paul Auguste

The QPQ-CD (Quantum and PostQuantum CipherKey Dynamic uses a dynamic key after the registration of the mobile at the 5G Network. The algorithm could be divided in two parts : The Quantum Cryptography (QC) and Post Quantum Cryptography (PQC) . The Post Quantum Cryptography will use 12 families of algorithms which are duplicate algorithm of : MD45, MD45xor, MD54, MD54xor, SHA256, SHA256xor for treating the 2 output QHT separately and QAT of the Quantum algorithm. Before the selector of the next key, the 12 keys of 256 bits are optimized of one bit change and selected the best effective probability. It will be based on probability by the extremity, probability of proximity, probability of a bit changed, and probability of disorder or binary entropy and probability of penalties. According to the order of its probabilities, the following key after QPQ-CD thus has the behavior: very far from the ends of the key (00 ... 000 and 11 ... 111); very far from the previous key; several bits changed and very messy from the point of view bit zero and bit one and the penalty of bad extremity proximity. All key chosen keys have a probability by the extremity and proximity between 50% until 100%. The probability of the bit changed is to 50%, the entropy is near 100%. The result is only obtained if the system uses optimization of one bit changed. Any chart representative also permits to include all 12 keys obtained after the Post Quantum algorithm have all chance to be selected by the system. So all varieties of PostQuantum Cryptography is necessary to be implemented on the QPQ-CD. All the result is simulated with Matlab.

International journal of advance research and innovative ideas in education•Jan 1, 2019•0 citations

NOVEL 5G AUTHENTICATION KEY AGREEMENT WITH QUANTUM AND POST QUANTUM CIPHERKEY DYNAMIC ON TELECOMMUNICATION NETWORKS

Rakotondramanana Radiarisainana Sitraka, Randriamitantsoa Paul Auguste

The 5G telecommunication network security is based on the standard specified by 3GPP (3rd Generation Partnership Project) and on the security of the master key shared between the UE (User Equipment) and the operator. To authenticate to the network, the 5G-AKA (5G-Authentication Key Agreement) protocol uses mutual authentication. Users resp. operators use cryptography to verify the authenticity of the operator resp. users. However, knowledge of the master key can create a hacker network that can capture the traffic of users. The QPQ- CD module (Quantum and Post Quantum Cipherkey Dynamic) consists of modifying the 3GPP standard by adding a recurrent change of this key to each successful authentication. The quantum part of QPQ-CD will be formed by a quantum confusion technique based on the Hilbert QHT (Quantum Hilbert Transform) method and the Arnold QAT (Quantum Arnold Transform) method on 3 matrices. The Post-Quantum part of QPQ-CD will focus on multiple hashing methods. The 12 families of hash algorithm used will reduce the matrices to 256 bits. An optimizer based on a one-bit change and an effective probability selector perfect the choice of the next key. The effective probability of the key will be based on probability of extremity, probability of proximity, probability of a bit changed, and probability of disorder or binary entropy and probability of penalties. According to the order of its probabilities, the following key after QPQ-CD thus has the behavior: very far from the ends of the key (00 ... 000 and 11 ... 111); very far from the previous key; several bits changed and very messy from the point of view bit zero and bit one and the penalty of bad extremity proximity. One of the 5 approaches of selectors and key optimizer will be perfected to refine the result. By simulating on MATLAB several authentication tests, the probability of the extremity and proximity will both be greater than or equal to 50% and the probability in case of binary entropy and disorder will be close to 100%. The effective probability of selection at this time will be greater than 50%

International journal of advance research and innovative ideas in education•Jan 1, 2019•0 citations

Quantum Image Cryptography of Continuous Chaotic Maps by Using Pixel Shuffeling

Shilpa M. Satre

Images are important data carriers because, compared to text data, they are harder to transfer or store securely and include higher volumes and redundancies of digital data. Images can be shielded against a variety of risks with security, including eavesdropping and illegal copying and alteration. Because of the potential quantum risk to the existing cryptographic encryption methods and the quick advancement towards the development of quantum computers, quantum image encryption algorithms have recently drawn increasing amounts of attention. The majority of quantum image encryption techniques such as diffusion and scrambling, involve two separate rounds. In this model, the three different chaotic maps are used separately for scrambling the images to determine the performance of the quantum image cryptography with different combination of the model. At first, the hash256 algorithm is used for generating the quantum key and the forward diffusion takes place for diffusing the first pixel to final pixel of the input image information. Then, the three different chaotic maps such as pixel permutation, Chen attractor and Lorenz attractor are used for scrambling the input image. Finally, the bit-level permutation and backward diffusion process are considered for the scrambled image. For evaluating the performance of the quantum image cryptography based on the three different chaotic maps, the NPCR, UACI, Entropy, SSIM, correlation characteristics and histogram analysis are determined. The attained NPCR, UACI, Entropy and SSIM of the CASIA2 dataset for Lorenz attractor are improved than the pixel permutation and Chen attractor. Thus, from the attained values, the Quantum Image Cryptography Based on Continuous Chaotic Map such as Lorenz attractor performs better for the statistical and differential analysis than the other chaotic maps.

Journal of Electrical Systems•Apr 10, 2024•0 citations

Research and application of Big data encryption technology based on quantum lightweight image encryption

Ye Ma

Given the limitations of current classic image encryption algorithms and the unconditional security characteristics of quantum key distribution protocols, the author proposes an image encryption method based on quantum key distribution and pixel scrambling. The author first analyzed the security issues of quantum image encryption algorithms based on image scrambling methods, namely that image scrambling methods have periodicity, which can ensure that the image can be restored after scrambling. If an image cannot be guaranteed to return to its original state after performing scrambling operations, legitimate users cannot obtain the secret information in the original image, and image scrambling loses its original meaning; However, the periodicity of image scrambling methods not only ensures that legitimate users can decrypt images, but also provides convenience for attackers to steal original image information. Secondly, it is pointed out that when evaluating and analyzing quantum image encryption algorithms, the evaluation indicators should include two parts: One is performance analysis, which is the analysis of the network complexity of quantum circuits. In quantum computing, the network complexity of quantum circuits is usually represented by the number of quantum basic logic gates. The second is security analysis, which mainly includes key analysis (including key space size and key sensitivity analysis), statistical analysis (including pixel correlation, histogram analysis, information fusion, and scatter plot distribution density analysis). Finally, experimental simulations have shown that the NPCR values of the plaintext and ciphertext images of the three images tend to 100%. The encrypted image histogram is evenly distributed, with very weak pixel correlation and high pixel change rate and information entropy.

Results in Physics•Oct 4, 2023•19 citations

Post-quantum image encryption based on a chaotic system and the Rubik's cube principle

A. V. Sidorenko, I. V. Sergeev

Objectives. The aim of the work is the development and experimental verification of a hybrid postquantum image encryption algorithm based on a 3D chaotic system and the Rubik's cube principle. Methods. Issues of the vulnerability of traditional encryption methods to attacks using quantum computers are considered. To create a cryptographically robust algorithm, it is proposed to combine the advantages of chaotic systems and quantum computing. A new 3D chaotic system based on a modified Lorenz system is used for generating pseudorandom keys. The Rubik's cube principle is applied to perform image scrambling operations (cyclic shifting of rows and columns). The NEQR (Novel Enhanced Quantum Representation) model is used for quantum representation and data processing. The algorithm is implemented in Python using the Quiskit, OpenCV, and NumPy libraries, as well as the AerSimulator quantum computing simulator. Results. A hybrid encryption algorithm has been developed and implemented as a computer program. The algorithm was tested on images of various sizes and formats. Resistance to statistical and differential attacks has been experimentally confirmed: the correlation coefficient of adjacent pixels in the encrypted images is close to zero, the information entropy is close to the ideal value of 8, and the NPCR and PSNR values exceed 99,25 % and are less than 13 dB, respectively. Conclusion. The proposed hybrid algorithm demonstrates high cryptographic strength and efficiency. Key sensitivity, the use of quantum principles, and performance optimization through multithreading make it practical for use in security-critical areas such as IoT, telemedicine, and cloud storage. The software implementation operates locally without requiring an internet connection, which ensures data security.

Informatics•Sep 26, 2026•0 citations

Analysis on Quantum Cryptographic Approaches for Image Encryption

Shilpa M. Satre, Bharti Joshi

To secure and protect the photos from unfair tactics, the encryption process is used. the advent of the digital era has made it exceedingly easy to hack any data kept on the cloud. Encryption is critical to ensuring communication security, which is a crucial issue. There are numerous photo encryption methods that mostly rely on chaotic logistic maps; however, they have downsides such a small key space and low security. Current analysis introduced experimental results of quantum chaotic cryptosystem,3D-Chaotic map and quantum chaotic logistic map. This paper we measure image encryption parameters are Entropy, structural similarity index measure, combined average changing intensity and net pixel change rate which defines utilization of suitable image encryption approaches. For the cypher and the original image, we quantify the correlation coefficient value in both the horizontal and vertical positions with comparison of all three existing Approach-es performance. The scientific and practical economic results reveal that the quantum chaotic cryptosystem has outstanding performance and in future with utilization of advanced Approaches we can resist various cryptographic attacks.

International Conference on Intelligent Technologies (CONIT)•Jun 23, 2023•1 citation
The QPQ-CD (Quantum and PostQuantum CipherKey Dynamic uses a dynamic key after the registration of the
mobile at the 5G Network. The algorithm could be divided in two parts : The Quantum Cryptography and
Post Quantum Cryptography. The Quantum Cryptography used Quantum Image Scrambling methods
with the Red, Green, and Blue Component which are treated separately by the two algorithms QAT and
QHT. They change only the position of the image pixel without changing the value of this. QAT and QHT
use 2 method different : one is based on the permutation of the pixel position and the others is based on
one the space-filling curveIn this article, the performance of the Quantum Cryptography using at the
QPQ-CD is analyzed by the PSNR(Peak Signal to Noise Ratio), SSIM (Structural SIMilarity),
NPCR(Number of Pixel exchange rate), UACI (Unified Average Changing Intensity), Correlation and
the binary entropy. PSNR for the two methods is near than the value 8 which is a good visual quality
visualThe SSIM and Correlation also offers a best parameter which is near zero. The image transformed
by scrambling methods and originals are no similitude and no correlation. The NPCR give also a good
performance because 99% of pixels changed in the image. But the UACI is not more than 20%. So, the
intensity light of the new image doesn’t change with the maximum. The algorithm of the scrambling is not
resistant to the attack physic using difference power analysis. The binary entropy is less than 50%. There
are quite no disorder between the bits one and bit zeros. The QPQ-CD with evaluation of the Quantum
Cryptography is simulated to Matlab and all curve for this is represented in this article. The QAT and
QHT have quite a similar performance.
The QPQ-CD (Quantum and PostQuantum CipherKey Dynamic uses a dynamic key after the registration of the mobile at the 5G Network. The algorithm could be divided in two parts : The Quantum Cryptography (QC) and Post Quantum Cryptography (PQC) . The Post Quantum Cryptography will use 12 families of algorithms which are duplicate algorithm of : MD45, MD45xor, MD54, MD54xor, SHA256, SHA256xor for treating the 2 output QHT separately and QAT of the Quantum algorithm. Before the selector of the next key, the 12 keys of 256 bits are optimized of one bit change and selected the best effective probability. It will be based on probability by the extremity, probability of proximity, probability of a bit changed, and probability of disorder or binary entropy and probability of penalties. According to the order of its probabilities, the following key after QPQ-CD thus has the behavior: very far from the ends of the key (00 ... 000 and 11 ... 111); very far from the previous key; several bits changed and very messy from the point of view bit zero and bit one and the penalty of bad extremity proximity. All key chosen keys have a probability by the extremity and proximity between 50% until 100%. The probability of the bit changed is to 50%, the entropy is near 100%. The result is only obtained if the system uses optimization of one bit changed. Any chart representative also permits to include all 12 keys obtained after the Post Quantum algorithm have all chance to be selected by the system. So all varieties of PostQuantum Cryptography is necessary to be implemented on the QPQ-CD. All the result is simulated with Matlab.
The 5G telecommunication network security is based on the standard specified by 3GPP (3rd Generation Partnership Project) and on the security of the master key shared between the UE (User Equipment) and the operator. To authenticate to the network, the 5G-AKA (5G-Authentication Key Agreement) protocol uses mutual authentication. Users resp. operators use cryptography to verify the authenticity of the operator resp. users. However, knowledge of the master key can create a hacker network that can capture the traffic of users. The QPQ- CD module (Quantum and Post Quantum Cipherkey Dynamic) consists of modifying the 3GPP standard by adding a recurrent change of this key to each successful authentication. The quantum part of QPQ-CD will be formed by a quantum confusion technique based on the Hilbert QHT (Quantum Hilbert Transform) method and the Arnold QAT (Quantum Arnold Transform) method on 3 matrices. The Post-Quantum part of QPQ-CD will focus on multiple hashing methods. The 12 families of hash algorithm used will reduce the matrices to 256 bits. An optimizer based on a one-bit change and an effective probability selector perfect the choice of the next key. The effective probability of the key will be based on probability of extremity, probability of proximity, probability of a bit changed, and probability of disorder or binary entropy and probability of penalties. According to the order of its probabilities, the following key after QPQ-CD thus has the behavior: very far from the ends of the key (00 ... 000 and 11 ... 111); very far from the previous key; several bits changed and very messy from the point of view bit zero and bit one and the penalty of bad extremity proximity. One of the 5 approaches of selectors and key optimizer will be perfected to refine the result. By simulating on MATLAB several authentication tests, the probability of the extremity and proximity will both be greater than or equal to 50% and the probability in case of binary entropy and disorder will be close to 100%. The effective probability of selection at this time will be greater than 50%
Images are important data carriers because, compared to text data, they are harder to transfer or store securely and include higher volumes and redundancies of digital data. Images can be shielded against a variety of risks with security, including eavesdropping and illegal copying and alteration. Because of the potential quantum risk to the existing cryptographic encryption methods and the quick advancement towards the development of quantum computers, quantum image encryption algorithms have recently drawn increasing amounts of attention. The majority of quantum image encryption techniques such as diffusion and scrambling, involve two separate rounds. In this model, the three different chaotic maps are used separately for scrambling the images to determine the performance of the quantum image cryptography with different combination of the model. At first, the hash256 algorithm is used for generating the quantum key and the forward diffusion takes place for diffusing the first pixel to final pixel of the input image information. Then, the three different chaotic maps such as pixel permutation, Chen attractor and Lorenz attractor are used for scrambling the input image. Finally, the bit-level permutation and backward diffusion process are considered for the scrambled image. For evaluating the performance of the quantum image cryptography based on the three different chaotic maps, the NPCR, UACI, Entropy, SSIM, correlation characteristics and histogram analysis are determined. The attained NPCR, UACI, Entropy and SSIM of the CASIA2 dataset for Lorenz attractor are improved than the pixel permutation and Chen attractor. Thus, from the attained values, the Quantum Image Cryptography Based on Continuous Chaotic Map such as Lorenz attractor performs better for the statistical and differential analysis than the other chaotic maps.
Given the limitations of current classic image encryption algorithms and the unconditional security characteristics of quantum key distribution protocols, the author proposes an image encryption method based on quantum key distribution and pixel scrambling. The author first analyzed the security issues of quantum image encryption algorithms based on image scrambling methods, namely that image scrambling methods have periodicity, which can ensure that the image can be restored after scrambling. If an image cannot be guaranteed to return to its original state after performing scrambling operations, legitimate users cannot obtain the secret information in the original image, and image scrambling loses its original meaning; However, the periodicity of image scrambling methods not only ensures that legitimate users can decrypt images, but also provides convenience for attackers to steal original image information. Secondly, it is pointed out that when evaluating and analyzing quantum image encryption algorithms, the evaluation indicators should include two parts: One is performance analysis, which is the analysis of the network complexity of quantum circuits. In quantum computing, the network complexity of quantum circuits is usually represented by the number of quantum basic logic gates. The second is security analysis, which mainly includes key analysis (including key space size and key sensitivity analysis), statistical analysis (including pixel correlation, histogram analysis, information fusion, and scatter plot distribution density analysis). Finally, experimental simulations have shown that the NPCR values of the plaintext and ciphertext images of the three images tend to 100%. The encrypted image histogram is evenly distributed, with very weak pixel correlation and high pixel change rate and information entropy.
Objectives. The aim of the work is the development and experimental verification of a hybrid postquantum image encryption algorithm based on a 3D chaotic system and the Rubik's cube principle. Methods. Issues of the vulnerability of traditional encryption methods to attacks using quantum computers are considered. To create a cryptographically robust algorithm, it is proposed to combine the advantages of chaotic systems and quantum computing. A new 3D chaotic system based on a modified Lorenz system is used for generating pseudorandom keys. The Rubik's cube principle is applied to perform image scrambling operations (cyclic shifting of rows and columns). The NEQR (Novel Enhanced Quantum Representation) model is used for quantum representation and data processing. The algorithm is implemented in Python using the Quiskit, OpenCV, and NumPy libraries, as well as the AerSimulator quantum computing simulator. Results. A hybrid encryption algorithm has been developed and implemented as a computer program. The algorithm was tested on images of various sizes and formats. Resistance to statistical and differential attacks has been experimentally confirmed: the correlation coefficient of adjacent pixels in the encrypted images is close to zero, the information entropy is close to the ideal value of 8, and the NPCR and PSNR values exceed 99,25 % and are less than 13 dB, respectively. Conclusion. The proposed hybrid algorithm demonstrates high cryptographic strength and efficiency. Key sensitivity, the use of quantum principles, and performance optimization through multithreading make it practical for use in security-critical areas such as IoT, telemedicine, and cloud storage. The software implementation operates locally without requiring an internet connection, which ensures data security.
To secure and protect the photos from unfair tactics, the encryption process is used. the advent of the digital era has made it exceedingly easy to hack any data kept on the cloud. Encryption is critical to ensuring communication security, which is a crucial issue. There are numerous photo encryption methods that mostly rely on chaotic logistic maps; however, they have downsides such a small key space and low security. Current analysis introduced experimental results of quantum chaotic cryptosystem,3D-Chaotic map and quantum chaotic logistic map. This paper we measure image encryption parameters are Entropy, structural similarity index measure, combined average changing intensity and net pixel change rate which defines utilization of suitable image encryption approaches. For the cypher and the original image, we quantify the correlation coefficient value in both the horizontal and vertical positions with comparison of all three existing Approach-es performance. The scientific and practical economic results reveal that the quantum chaotic cryptosystem has outstanding performance and in future with utilization of advanced Approaches we can resist various cryptographic attacks.