Pseudo Quantum Random Number Generator with Quantum Permutation Pad

Kuang, Randy; Lou, Dafu; He, Alex; McKenzie, Chris; Redding, Michael

doi:10.1109/qce52317.2021.00053

Cited by 16 publications

(9 citation statements)

References 15 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.…”

Section: Quantum Permutation Padmentioning

confidence: 99%

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%

Quantum encryption with quantum permutation pad in IBMQ systems

Kuang

Perepechaenko

2022

EPJ Quantum Technol.

Self Cite

View full text Add to dashboard Cite

show abstract

“…The security of the QPP, which is at the heart of the D-QKD protocol has already been discussed in [25], especially in deep discussion in [29]. Its security depends on a pre-shared secret between 256 bits to 16KB in length and the permutation pad created there upon.…”

Section: Security Assessment Of D-qkdmentioning

confidence: 99%

Benchmark Performance of Digital QKD Platform Using Quantum Permutation Pad

Lou

Redding

et al. 2022

IEEE Access

Self Cite

View full text Add to dashboard Cite

Quantum permutation pad or QPP is a set of quantum permutation gates. QPP has been demonstrated for quantum secure encryption in both classical and quantum computing systems recently, even at a noisy 5-qubit IBMQ systems. In a classical computing system, QPP encryption is implemented as a permutation gate matrix multiplication with information state vectors. In a quantum computing system, QPP is compiled into a quantum encryption circuit in a native quantum computer and encryption is performed through QPP circuit. Leveraging its quantum mechanical characteristics, we report a digital QKD or D-QKD platform using QPP as a quantum mechanical algorithm implemented in classical systems to distribute quantum entropy, generated from physical quantum random number generators or QRNG, and quantum key over the internet. D-QKD interfaces have been developed to support the photonic QKD standard ETSI-014. This makes any systems with ETSI QKD standards compatible with D-QKD. D-QKD offers point-to-point quantum entropy and quantum key distributions as well as point-to-multi-points quantum key synchronizations with speeds 1000x faster than photonic QKD. This paper reports benchmark performance tests and randomness quality tests for pure quantum entropy generated by a QRNG and expanded entropy using the QPP protocol. The work has been funded by the PlanQK 1 project and deployed within the OpenQKD 2 testbed Berlin, operated by Deutsche Telekom.

show abstract

“…A different symmetric cryptographic algorithm was proposed by Kuang and Bettenburg in 2020, called the Quantum Permutation Pad (QPP) [18]. QPP has since been applied to create lightweight block cipher [19], streaming cipher [20], entropy expansion [21], and a pseudo-Quantum Random Number Generator or pQRNG [22]. Kuang and Barbeau recently proposed a concept of universal cryptography using QPP which can be implemented in both classical and quantum computing systems [23].…”

Section: Introductionmentioning

confidence: 99%

Quantum Encryption of superposition states with Quantum Permutation Pad in IBM Quantum Computers

Perepechaenko¹,

Kuang²

2023

Preprint

View full text Add to dashboard Cite

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.

show abstract

Pseudo Quantum Random Number Generator with Quantum Permutation Pad

Cited by 16 publications

References 15 publications

Quantum encryption with quantum permutation pad in IBMQ systems

Quantum encryption with quantum permutation pad in IBMQ systems

Benchmark Performance of Digital QKD Platform Using Quantum Permutation Pad

Quantum Encryption of superposition states with Quantum Permutation Pad in IBM Quantum Computers

Contact Info

Product

Resources

About