Wei-Min Shi, Pan Tian, Shou Wang, Yu-Guang Yang, Yi-Hua Zhou
{"title":"Quantum hash function based on continuous quantum walks","authors":"Wei-Min Shi, Pan Tian, Shou Wang, Yu-Guang Yang, Yi-Hua Zhou","doi":"10.1142/s0217732323501894","DOIUrl":null,"url":null,"abstract":"<p>A method of constructing a quantum hash function (QHF) based on continuous-time quantum walk is proposed, in which the time of quantum walk is controlled by the binary string message, namely, a binary string message as the input of the constructed QHF and the probability value of finally walking to the nodes on the cycle is used as the output of the QHF. Numerical simulation and performance analysis show that our QHF has obvious advantages in the efficiency of the QHF compared with the existing QHF based on the discrete-time quantum walk, that is, the efficiency of our scheme is nearly 4 times faster in computing the hash value of the same size file compared with the most efficient scheme. Besides, the QHF has also better collision resistance compared with the existing QHF based on the discrete-time quantum walk.</p>","PeriodicalId":18752,"journal":{"name":"Modern Physics Letters A","volume":"52 1","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Modern Physics Letters A","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.1142/s0217732323501894","RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ASTRONOMY & ASTROPHYSICS","Score":null,"Total":0}
引用次数: 0
Abstract
A method of constructing a quantum hash function (QHF) based on continuous-time quantum walk is proposed, in which the time of quantum walk is controlled by the binary string message, namely, a binary string message as the input of the constructed QHF and the probability value of finally walking to the nodes on the cycle is used as the output of the QHF. Numerical simulation and performance analysis show that our QHF has obvious advantages in the efficiency of the QHF compared with the existing QHF based on the discrete-time quantum walk, that is, the efficiency of our scheme is nearly 4 times faster in computing the hash value of the same size file compared with the most efficient scheme. Besides, the QHF has also better collision resistance compared with the existing QHF based on the discrete-time quantum walk.
期刊介绍:
This letters journal, launched in 1986, consists of research papers covering current research developments in Gravitation, Cosmology, Astrophysics, Nuclear Physics, Particles and Fields, Accelerator physics, and Quantum Information. A Brief Review section has also been initiated with the purpose of publishing short reports on the latest experimental findings and urgent new theoretical developments.