检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]国防科学技术大学电子科学与工程学院,湖南长沙410073
出 处:《通信学报》2007年第1期64-68,共5页Journal on Communications
基 金:国家自然科学基金资助项目(60472032)~~
摘 要:基于量子一次一密和量子密钥分配,提出了一种针对经典消息的高效量子签名协议。该协议利用Hash函数对经典消息取摘要,将任意位的经典消息编码为确定位数的量子信息,在对位数较多的经典信息签名时,大大减少了密钥长度和所需传输的量子位。协议不需要使用纠缠态,只需要进行von Neumann测量。与现有的几种量子签名协议相比,协议效率显著提高。An efficient quantum signature protocol of classical messages which was based on quantum one-time pad and quantum key distribution was presented. The classical messages of any length could be encoded into the quantum information of determinate length because hash function was used to generate message digests. Especially for a large number of messages, the length of shared keys and the number of qubits were greatly shortened in the present protocol. Moreover, it was unnecessary for the protocol to use entangled states and only yon Neumann measurement was needed. Compared with other quantum signature protocols, the efficiency of the present quantum signature protocol was greatly improved.
关 键 词:量子信息 量子签名协议 量子一次一密 量子密钥分配
分 类 号:TP309.7[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222