Quantum permutation pad for universal quantum-safe cryptography

Kuang, Randy; Barbeau, Michel

doi:10.1007/s11128-022-03557-y

Cited by 19 publications

(30 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kuang et al reported their QPP implementations as a lightweight quantum safe block cipher [23] and streaming cipher [24], entropy transformation and expansion [25], pseudo quantum random number generation [27]. Kuang and Barbeau recently proposed a universal quantum safe cryptography with QPP [26] for potential quantum encrypted communications between two quantum computers and one quantum one classical computers over the existing internet or future quantum internet. Perepechaenko and Kuang have demonstrated their first toy implementation of QPP in IBM 5-qubit quantum computer recently [28].…”

Section: Quantum Permutation Padmentioning

confidence: 99%

“…On the other hand, the attack on the algorithm itself should require brute force search with complexity O (2 256 ). Thus, the Permutation Key Space, as described in [26], should have 256 bits of entropy. This is possible if the Permutation Pad consists of sufficient number of permutations.…”

Section: Entropymentioning

confidence: 99%

“…The more detailed security analysis of the QPP can be found in [26], however, in this section, we want to present the reader with the ENT test results of the ciphertext produced by encryption on the picture in Fig. 7 using 2-and 3-qubits QPP.…”

Section: Cipher Randomnessmentioning

confidence: 99%

“…in [26]. However, we will point out that although the randomization step already encrypts the plaintext, the same pre-shared key used for randomization can not be reused.…”

Section: Appendixmentioning

confidence: 99%

“…Due to its relative simplicity, we could create a hybrid quantum-classical scheme of quantum encrypted secure communications over a potential hybrid internet. While this paper focuses entirely on the implementation of QPP in quantum systems, detailed security analysis can be found in a very recent publication by Kuang and Barbeau in 2022 [26].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Quantum encryption with quantum permutation pad in IBMQ systems

Kuang

Perepechaenko

2022

EPJ Quantum Technol.

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Quantum Permutation Padmentioning

confidence: 99%

Section: Entropymentioning

confidence: 99%

Section: Cipher Randomnessmentioning

confidence: 99%

“…in [26]. However, we will point out that although the randomization step already encrypts the plaintext, the same pre-shared key used for randomization can not be reused.…”

Section: Appendixmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations