Benchmark Performance of Digital QKD Platform Using Quantum Permutation Pad

Abstract

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.

Quantum Secure Lightweight Cryptography with Quantum Permutation Pad

“…The values of n and M are chosen based on the security requirements. Quantropi has developed its digital QKD platform with n = 8 and M = 64, providing a total equivalent entropy of over 100,000 bits [25]. For a typical quantum-safe scenario with more than 256 bits of entropy, one can choose n = 4 and M = 8 for a total of 360 bits of entropy.…”

“…Kuang and Barbeau demonstrated QKD photonic implementations, involving identity and XOR permutations within the Galois permutation group over the finite field {0, 1} [14], framing QKD as a physical realization of Shannon's OTP scheme [37]. The natural non-commutativity of the Galois permutation group favors digital QPP implementations over physical QKD with more than one qubit [25]. Digital QKD becomes an economical, deployable, and scalable alternative for quantum-secure internet communication [32,25,26,18,15,16,17].…”

“…The natural non-commutativity of the Galois permutation group favors digital QPP implementations over physical QKD with more than one qubit [25]. Digital QKD becomes an economical, deployable, and scalable alternative for quantum-secure internet communication [32,25,26,18,15,16,17]. Kuang and Perepechaenko also demonstrated their QPP implementations in native quantum computing system [19,33,34].…”