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

Jurnal Teknologi Informasi dan Terapan

An Encryption Method of 8-Qubit States Using Unitary Matrix and Permutation

Bekti Maryuni Susanto, Rizky Alfanio Atmoko, Erik Yohan Kartiko, Agung Teguh Setyadi

Published Oct 17, 2025• 0 citations
Publisher

Abstract

The paper explores the methods for encrypting and decrypting an 8-qubit states of quantum system using unitary and permutation matrix. Our approach utilizes a unitary matrix to create a new superpositions of an encrypted 8-qubits states. By applying a permutation matrix, we shuffle the state vectors, adding an additional layer of security. The encryption process will be performed on the encrypted state using the formula , where is the original state vector, is the unitary matrix, and is the permutation matrix. To ensure the total probability remains normalized, we showed that the resulting new 8-qubits state remains normalized. The decryption process is achieved by applying the following operations retrieving the original state. This paper also is showing that the original quantum state can be accurately recovered post-decryption. This highlights the robustness of our approach in maintaining the integrity of quantum information. Furthermore, we aim to create block for different 8-qubits state using a different key in each block from the initial unitary matrix and permutation . In order to implement these methods, we need to generate a new unitary matrix for each block. Either by random pick or using iteration. In fact, we showed how to create the new unitary matrix using iteration for each block. Here we showed that the new generated matrix is also a unitary matrix so that we can use iteration proses to create a new unitary matrix in each block for different 8-qubits state. Here we generate the unitary matrix from as key in block . This result in the encryption of each block for each 8-qubits state using the formula resulting in a more robust security. The encryption/decryption scheme we referenced can theoretically be implemented on modern quantum hardware but verifying operations involving hundreds of qubits would demand rigorous calibration and error correction

DOI
10.25047/jtit.v11i2.433

Related papers

Enhanced Quantum Permutation Pad for Quantum Based Text Encryption

Ayush Goyal, T Janani

This paper proposes an advanced quantum text encryption scheme based on an Enhanced Quantum Permutation Pad (QPP). The method begins by generating$6 \times 6$padded matrices derived from all possible permutations of four basis vectors in$\mathbb{R}^{4}$. These matrices are converted into binary strings and encrypted using two-qubit quantum circuits, where$X$and CNOT gates enable quantum entanglement and conditional operations. A binary key is applied to influence the behavior of the quantum circuits during both encryption and decryption. The encryption logic is simulated using Qiskit's AerSimulator, and the resulting binary data is reconstructed into its original structure through matrix extraction. Experimental evaluation using the ENT test demonstrates a high entropy value of 7.66, indicating strong randomness and robustness of the encryption. This methodology presents a secure and structured approach to quantum encryption, combining permutation logic with quantum operations to ensure confidentiality and resistance to classical attacks.

International Conference on Networks and Cryptology (NETCRYPT)•May 29, 2025•0 citations

Quantum encryption of superposition states with quantum permutation pad in IBM quantum computers

Maria Perepechaenko, Randy Kuang

Abstract We present an implementation of Kuang and Bettenburg’s Quantum Permutation Pad (QPP) used to encrypt superposition states. The project was conducted on currently available IBM quantum systems using the Qiskit development kit. This work extends previously reported implementation of QPP used to encrypt basis states and demonstrates that application of the QPP scheme is not limited to the encryption of basis states. For this implementation, a pad of 56 2-qubit Permutation matrices was used, providing 256 bits of entropy for the QPP algorithm. An image of a cat was used as the plaintext for this experiment. The plaintext was randomized using a classical XOR function prior to the state preparation procedure. To create corresponding superposition states, we applied a novel operator defined in this paper. These superposition states were then encrypted using QPP, with 2-qubit Permutation Operators, producing superposition ciphertext states. Due to the lack of a quantum channel, we omitted the transmission and executed the decryption procedure on the same IBM quantum system. If a quantum channel existed, the superposition ciphertext states could be transmitted as qubits, and be directly decrypted on a different quantum system. We provide a brief discussion of the security, although the focus of the paper remains on the implementation. Previously we have demonstrated QPP operating in both classical and quantum computers, offering an interesting opportunity to bridge the security gap between classical and quantum systems. This work broadens the applicability of QPP for the encryption of basis states as well as superposition states. We believe that quantum encryption schemes that are not limited to basis states will be integral to a secure quantum internet, to reduce vulnerabilities introduced by using two separate algorithms for secure communication between a quantum and a classical computer.

arXiv:2301.10832•EPJ Quantum Technology•Feb 17, 2023•39 citations

Quantum Encryption and Decryption in IBMQ Systems using Quantum Permutation Pad

Maria Perepechaenko, Randy Kuang

We present a functioning implementation of Kuang et al.’s Quantum Permutation Pad (QPP) using the Qiskit developmental kit on the currently available International Business Machines (IBM) quantum computers. For this implementation, we use a pad with 28 2-qubit permutation gates that provides 128 bits of entropy. In this implementation, we divide the plaintext into blocks of 2-bits each. Each such block is encrypted one at a time. For any given block of plaintext, a quantum circuit is created with qubits initialized according to the given plaintext 2-bit block. The plaintext qubits are then acted on with 2-qubit permutation operators chosen from a 28- permutation QPP pad. Due to the inability to send qubits directly, the ciphertext qubits are measured and transmitted to the decrypting side over a classical channel. The decryption can be performed on either a classical or quantum computer. The decryption uses an inverse Quantum Permutation Pad with the Hermitian conjugates of the corresponding permutation gates used for the encryption. We are currently working on advancing the implementation of QPP to include additional steps for security and efficiency.

Journal of Communications•Jan 1, 2022•15 citations

Quantum encryption with quantum permutation pad in IBMQ systems

Randy Kuang, Maria Perepechaenko

Abstract Quantum permutation pad or QPP is a quantum-safe symmetric cryptographic algorithm proposed by Kuang and Bettenburg in 2020. The theoretical foundation of QPP leverages the linear algebraic representations of quantum gates which makes QPP realizable in both, quantum and classical systems. By applying the QPP with 64 of 8-bit permutation gates, holding respective entropy of over 100,000 bits, we accomplished quantum random number distributions digitally over today’s classical internet. The QPP has also been used to create pseudo quantum random numbers and served as a foundation for quantum-safe lightweight block and streaming ciphers. This paper continues to explore numerous applications of QPP, namely, we present an implementation of QPP as a quantum encryption circuit on today’s still noisy quantum computers. With the publicly available 5-qubit IBMQ devices, we demonstrate quantum secure encryption (256 bits of entropy) using 2-qubit QPP with 56 permutation gates, and 3-qubit QPP with 17 permutation gates respectively. Initial qubits of the encryption circuit correspond to the plaintext and after applying quantum encryption operations, cipher qubits are measured with probabilistic distributions, and the results with the highest probability are recorded as cipher bits. The cipher bits are then decrypted with an inverse QPP circuit. The output state plaintext qubits are measured and the most frequent count measurement results are recorded as plaintext bits. This quantum encryption and decryption process clearly demonstrates that QPP quantum implementations works exactly as symmetric encryption and decryption schemes should. The plaintext and ciphertext bits can also be encrypted and decrypted respectively by any classical computing device with the corresponding QPP algorithm as in quantum computers. This work reveals that it is possible to build quantum-secure communications between quantum-to-quantum and quantum-to-classical computers over today’s internet and the future quantum internet.

EPJ Quantum Technology•Oct 12, 2022•38 citations

Practical quantum encryption protocol with varying encryption configurations

Junxu Li, Zixuan Hu, Sabre Kais

Quantum communication is an important application that derives from the burgeoning field of quantum information and quantum computation.Focusing on secure communication, quantum cryptography has two major directions of development, namely quantum key distribution and quantum encryption.In this work we propose a quantum encryption protocol that utilizes a quantum algorithm to create blocks of ciphertexts based on quantum states.The main feature of our quantum encryption protocol is that the encryption configuration of each block is determined by the previous blocks, such that additional security is provided.We then demonstrate our method by an example model encrypting the English alphabet, with numerical simulation results showing the large error rate of a mock attack by a potential adversary.The safety of the encryption method is further demonstrated against several possible attack models.With the improvements against noises, our quantum encryption protocol is a capable addition to the toolbox of quantum cryptography.

arXiv:2101.09314•Physical Review Research•Jun 28, 2021•7 citations

Quantum data communication protection with the quantum permutation pad block cipher in counter mode and Clifford operators

Michel Barbeau

Background: This article integrates two cryptographic schemes for quantum data protection. The result achieves authentification, confidentiality, integrity, and replay protection. The authentication, integrity, and replay aspects leverage quantum Clifford operators. Confidentiality of quantum messages is achieved using the quantum permutation pad (QPP) cryptographic scheme. Methods: Clifford operators and the QPP are combined into a block cipher in counter mode. A shared secret is used to seed a random number generator for the arbitrary selection of Clifford operators and quantum permutations to produce a signature field and perform encryption. An encryption and signature algorithm and a decryption and authentication algorithm are specified to protect quantum messages. Results: A symmetric key block cipher with authentication is described. The plain text is signed with a sequence of randomly selected Clifford operators. The signed plaintext is encrypted with a sequence of randomly selected permutations. The algorithms are analyzed. As a function of the values selected for the security parameters, there is an unavoidable risk of collision. The probability of block collision is modelled versus the number of blocks encrypted, for block sizes two, three, four, and five qubits. Conclusions: The scheme is practical but does not achieve perfect indistinguishability because of the risk of message collision. This is normal and unavoidable when fixed-size fields are assumed to make a scheme practical. The model can be used to determine the values of the security parameters and the lifetime of session keys to mitigate the risk of information leakage according to the needs of the scheme’s users. The session key can be renewed when a tolerable maximum number of messages has been sent.

F1000Research•Sep 11, 2023•3 citations
The paper explores the methods for encrypting and decrypting an 8-qubit states of quantum system using unitary and permutation matrix. Our approach utilizes a unitary matrix to create a new superpositions of an encrypted 8-qubits states. By applying a permutation matrix, we shuffle the state vectors, adding an additional layer of security. The encryption process will be performed on the encrypted state using the formula , where is the original state vector, is the unitary matrix, and is the permutation matrix. To ensure the total probability remains normalized, we showed that the resulting new 8-qubits state remains normalized. The decryption process is achieved by applying the following operations retrieving the original state. This paper also is showing that the original quantum state can be accurately recovered post-decryption. This highlights the robustness of our approach in maintaining the integrity of quantum information. Furthermore, we aim to create block for different 8-qubits state using a different key in each block from the initial unitary matrix and permutation . In order to implement these methods, we need to generate a new unitary matrix for each block. Either by random pick or using iteration. In fact, we showed how to create the new unitary matrix using iteration for each block. Here we showed that the new generated matrix is also a unitary matrix so that we can use iteration proses to create a new unitary matrix in each block for different 8-qubits state. Here we generate the unitary matrix from as key in block . This result in the encryption of each block for each 8-qubits state using the formula resulting in a more robust security. The encryption/decryption scheme we referenced can theoretically be implemented on modern quantum hardware but verifying operations involving hundreds of qubits would demand rigorous calibration and error correction
This paper proposes an advanced quantum text encryption scheme based on an Enhanced Quantum Permutation Pad (QPP). The method begins by generating6×66 \times 66×6padded matrices derived from all possible permutations of four basis vectors inR4\mathbb{R}^{4}R4. These matrices are converted into binary strings and encrypted using two-qubit quantum circuits, whereXXXand CNOT gates enable quantum entanglement and conditional operations. A binary key is applied to influence the behavior of the quantum circuits during both encryption and decryption. The encryption logic is simulated using Qiskit's AerSimulator, and the resulting binary data is reconstructed into its original structure through matrix extraction. Experimental evaluation using the ENT test demonstrates a high entropy value of 7.66, indicating strong randomness and robustness of the encryption. This methodology presents a secure and structured approach to quantum encryption, combining permutation logic with quantum operations to ensure confidentiality and resistance to classical attacks.
Abstract We present an implementation of Kuang and Bettenburg’s Quantum Permutation Pad (QPP) used to encrypt superposition states. The project was conducted on currently available IBM quantum systems using the Qiskit development kit. This work extends previously reported implementation of QPP used to encrypt basis states and demonstrates that application of the QPP scheme is not limited to the encryption of basis states. For this implementation, a pad of 56 2-qubit Permutation matrices was used, providing 256 bits of entropy for the QPP algorithm. An image of a cat was used as the plaintext for this experiment. The plaintext was randomized using a classical XOR function prior to the state preparation procedure. To create corresponding superposition states, we applied a novel operator defined in this paper. These superposition states were then encrypted using QPP, with 2-qubit Permutation Operators, producing superposition ciphertext states. Due to the lack of a quantum channel, we omitted the transmission and executed the decryption procedure on the same IBM quantum system. If a quantum channel existed, the superposition ciphertext states could be transmitted as qubits, and be directly decrypted on a different quantum system. We provide a brief discussion of the security, although the focus of the paper remains on the implementation. Previously we have demonstrated QPP operating in both classical and quantum computers, offering an interesting opportunity to bridge the security gap between classical and quantum systems. This work broadens the applicability of QPP for the encryption of basis states as well as superposition states. We believe that quantum encryption schemes that are not limited to basis states will be integral to a secure quantum internet, to reduce vulnerabilities introduced by using two separate algorithms for secure communication between a quantum and a classical computer.
We present a functioning implementation of Kuang et al.’s Quantum Permutation Pad (QPP) using the Qiskit developmental kit on the currently available International Business Machines (IBM) quantum computers. For this implementation, we use a pad with 28 2-qubit permutation gates that provides 128 bits of entropy. In this implementation, we divide the plaintext into blocks of 2-bits each. Each such block is encrypted one at a time. For any given block of plaintext, a quantum circuit is created with qubits initialized according to the given plaintext 2-bit block. The plaintext qubits are then acted on with 2-qubit permutation operators chosen from a 28- permutation QPP pad. Due to the inability to send qubits directly, the ciphertext qubits are measured and transmitted to the decrypting side over a classical channel. The decryption can be performed on either a classical or quantum computer. The decryption uses an inverse Quantum Permutation Pad with the Hermitian conjugates of the corresponding permutation gates used for the encryption. We are currently working on advancing the implementation of QPP to include additional steps for security and efficiency.
Abstract Quantum permutation pad or QPP is a quantum-safe symmetric cryptographic algorithm proposed by Kuang and Bettenburg in 2020. The theoretical foundation of QPP leverages the linear algebraic representations of quantum gates which makes QPP realizable in both, quantum and classical systems. By applying the QPP with 64 of 8-bit permutation gates, holding respective entropy of over 100,000 bits, we accomplished quantum random number distributions digitally over today’s classical internet. The QPP has also been used to create pseudo quantum random numbers and served as a foundation for quantum-safe lightweight block and streaming ciphers. This paper continues to explore numerous applications of QPP, namely, we present an implementation of QPP as a quantum encryption circuit on today’s still noisy quantum computers. With the publicly available 5-qubit IBMQ devices, we demonstrate quantum secure encryption (256 bits of entropy) using 2-qubit QPP with 56 permutation gates, and 3-qubit QPP with 17 permutation gates respectively. Initial qubits of the encryption circuit correspond to the plaintext and after applying quantum encryption operations, cipher qubits are measured with probabilistic distributions, and the results with the highest probability are recorded as cipher bits. The cipher bits are then decrypted with an inverse QPP circuit. The output state plaintext qubits are measured and the most frequent count measurement results are recorded as plaintext bits. This quantum encryption and decryption process clearly demonstrates that QPP quantum implementations works exactly as symmetric encryption and decryption schemes should. The plaintext and ciphertext bits can also be encrypted and decrypted respectively by any classical computing device with the corresponding QPP algorithm as in quantum computers. This work reveals that it is possible to build quantum-secure communications between quantum-to-quantum and quantum-to-classical computers over today’s internet and the future quantum internet.
Quantum communication is an important application that derives from the burgeoning field of quantum information and quantum computation.Focusing on secure communication, quantum cryptography has two major directions of development, namely quantum key distribution and quantum encryption.In this work we propose a quantum encryption protocol that utilizes a quantum algorithm to create blocks of ciphertexts based on quantum states.The main feature of our quantum encryption protocol is that the encryption configuration of each block is determined by the previous blocks, such that additional security is provided.We then demonstrate our method by an example model encrypting the English alphabet, with numerical simulation results showing the large error rate of a mock attack by a potential adversary.The safety of the encryption method is further demonstrated against several possible attack models.With the improvements against noises, our quantum encryption protocol is a capable addition to the toolbox of quantum cryptography.
Background: This article integrates two cryptographic schemes for quantum data protection. The result achieves authentification, confidentiality, integrity, and replay protection. The authentication, integrity, and replay aspects leverage quantum Clifford operators. Confidentiality of quantum messages is achieved using the quantum permutation pad (QPP) cryptographic scheme. Methods: Clifford operators and the QPP are combined into a block cipher in counter mode. A shared secret is used to seed a random number generator for the arbitrary selection of Clifford operators and quantum permutations to produce a signature field and perform encryption. An encryption and signature algorithm and a decryption and authentication algorithm are specified to protect quantum messages. Results: A symmetric key block cipher with authentication is described. The plain text is signed with a sequence of randomly selected Clifford operators. The signed plaintext is encrypted with a sequence of randomly selected permutations. The algorithms are analyzed. As a function of the values selected for the security parameters, there is an unavoidable risk of collision. The probability of block collision is modelled versus the number of blocks encrypted, for block sizes two, three, four, and five qubits. Conclusions: The scheme is practical but does not achieve perfect indistinguishability because of the risk of message collision. This is normal and unavoidable when fixed-size fields are assumed to make a scheme practical. The model can be used to determine the values of the security parameters and the lifetime of session keys to mitigate the risk of information leakage according to the needs of the scheme’s users. The session key can be renewed when a tolerable maximum number of messages has been sent.