{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T01:42:39Z","timestamp":1648604559813},"reference-count":0,"publisher":"Kaunas University of Technology (KTU)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ITC"],"abstract":"Quantum computing is no longer a thing of the future. Shor\u2019s 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.<\/jats:p>","DOI":"10.5755\/j01.itc.50.2.27570","type":"journal-article","created":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T10:53:02Z","timestamp":1623927182000},"page":"224-235","source":"Crossref","is-referenced-by-count":0,"title":["Quantum-Resistant Network for Classical Client Compatibility"],"prefix":"10.5755","volume":"50","author":[{"given":"Te-Yuan","family":"Lin","sequence":"first","affiliation":[]},{"given":"Chiou-Shann","family":"Fuh","sequence":"additional","affiliation":[]}],"member":"3786","published-online":{"date-parts":[[2021,6,17]]},"container-title":["Information Technology and Control"],"original-title":[],"link":[{"URL":"https:\/\/itc.ktu.lt\/index.php\/ITC\/article\/download\/27570\/14889","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/itc.ktu.lt\/index.php\/ITC\/article\/download\/27570\/14889","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T10:53:12Z","timestamp":1623927192000},"score":1,"resource":{"primary":{"URL":"https:\/\/itc.ktu.lt\/index.php\/ITC\/article\/view\/27570"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,17]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2021,6,17]]}},"URL":"https:\/\/doi.org\/10.5755\/j01.itc.50.2.27570","relation":{},"ISSN":["2335-884X","1392-124X"],"issn-type":[{"value":"2335-884X","type":"electronic"},{"value":"1392-124X","type":"print"}],"subject":[],"published":{"date-parts":[[2021,6,17]]}}}