Entropy Transformation and Expansion with Quantum Permutation Pad for 5G Secure Networks

Lou, Dafu; Kuang, Randy; He, Alex

doi:10.1109/icct52962.2021.9657891

Cited by 8 publications

(12 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We report benchmark results of QE/QK distributions for pure QE distributed from D-QKD cloud but cached locally at Alice and expanded QE with pQRNG [28] at Alice.…”

Section: Benchmark Performance Resultsmentioning

confidence: 99%

“…QPP can be also used for entropy expansion [27] and pseudoquantum random number generation or pQRNG [28]. This can allow us to expand the true QE multiple times such as 10x as shown in Fig.…”

Section: B Qe/qk Distribution With Qe Expansionmentioning

confidence: 99%

“…Kuang, et al reported their streaming cipher implementation with QPP in 2021 [27]. [28] carried out an entropy expansion and distribution with QPP for 5G backhaul using for AES true random keys and nonces, either from a true QRNG distributed by QPP or local expansions by QPP at 5G local stations. Kuang, et al in 2021 [29] also proposed a new pseudo quantum random number generator (pQRNG) using QPP which can hold over 100,000 bits of entropy.…”

mentioning

confidence: 99%

See 2 more Smart Citations

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

“…We report benchmark results of QE/QK distributions for pure QE distributed from D-QKD cloud but cached locally at Alice and expanded QE with pQRNG [28] at Alice.…”

Section: Benchmark Performance Resultsmentioning

confidence: 99%

Section: B Qe/qk Distribution With Qe Expansionmentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

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

show abstract

“…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%

“…It is well-known that permutation transformations are bijective over computational basis, so the QPP encryption holds the property of Shannon perfect secrecy. The QPP encryption scheme has been applied to different cases recently in classical computing [23][24][25]. For an n-qubit computational basis, there exist a total of 2 n !…”

Section: Introductionmentioning

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

Quantum permutation pad for universal quantum-safe cryptography

Kuang

Barbeau

2022

Quantum Inf Process

View full text Add to dashboard Cite

Entropy Transformation and Expansion with Quantum Permutation Pad for 5G Secure Networks

Cited by 8 publications

References 11 publications

Benchmark Performance of Digital QKD Platform Using Quantum Permutation Pad

Benchmark Performance of Digital QKD Platform Using Quantum Permutation Pad

Quantum encryption with quantum permutation pad in IBMQ systems

Quantum permutation pad for universal quantum-safe cryptography

Contact Info

Product

Resources

About