Open AccessQuantum-Resistant Network for Classical Client Compatibility
Author(s) -
Te-Yuan Lin,
Chiou-Shann Fuh
Publication year - 2021
Publication title -
informacinės technologijos ir valdymas
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.286
H-Index - 19
eISSN - 2335-884X
pISSN - 1392-124X
DOI - 10.5755/j01.itc.50.2.27570
Subject(s) - computer science , quantum computer , quantum cryptography , quantum network , theoretical computer science , post quantum cryptography , quantum algorithm , eavesdropping , quantum , cryptography , quantum information , computer security , quantum mechanics , physics
Quantum computing is no longer a thing of the future. Shor’s algorithm proved that a quantum computer couldtraverse key of factoring problems in polynomial time. Because the time-complexity of the exhaustive keysearch for quantum computing has not reliably exceeded the reasonable expiry of crypto key validity, it is believedthat current cryptography systems built on top of computational security are not quantum-safe. Quantumkey distribution fundamentally solves the problem of eavesdropping; nevertheless, it requires quantumpreparatory 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 stringentproblem. In this research, we innovatively tackled this challenge using a non-computational difficulty schemewith zero-knowledge proof in order to achieve repellency against quantum computing cryptanalysis attacks foruniversal classical clients.