Quantum-resistant network for classical client compatibility

Abstract

Quantum computing is no longer a thing of the future. Shor’s algorithm proved that a quantum computer could traverse key of factoring problems in polynomial time. Because the time-complexity of the exhaustive key search for quantum computing has not reliably exceeded the reasonable expiry of crypto key validity, it is believed that current cryptography systems built on top of computational security are not quantum-safe. Quantum key distribution fundamentally solves the problem of eavesdropping; nevertheless, it requires quantum preparatory work and quantum-network infrastructure, and these remain unrealistic with classical computers. In transitioning to a mature quantum world, developing a quantum-resistant mechanism becomes a stringent problem. In this research, we innovatively tackled this challenge using a non-computational difficulty scheme with zero-knowledge proof in order to achieve repellency against quantum computing cryptanalysis attacks for universal classical clients.