检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:童启夏 胡莹莹 何德勇[1] 韩正甫[1] Tong Qixia;Hu Yingying;He Deyong;Han Zhengfu(CAS Key Laboratory of Quantum Information,University of Science and Technology of China,Hefei 230026,Anhui,China)
机构地区:[1]中国科学技术大学中国科学院量子信息重点实验室,安徽合肥230026
出 处:《激光与光电子学进展》2024年第5期481-485,共5页Laser & Optoelectronics Progress
基 金:国家自然科学基金(62271463)。
摘 要:在实用化的高速量子随机数产生器的应用中,使用Toeplitz矩阵作为后处理方法提取量子随机数随机性已成为一种主要的技术路线。然而,Toeplitz矩阵更适合于硬件计算而不适合软件运算,通常需要搭建专门的现场可编程门阵列(FPGA)电路才能进行快速运算。基于自发辐射放大(ASE)的量子随机产生器,提出一种基于简单哈希函数的快速后处理方式。这种方式的时间复杂度仅为O(N),小于Toeplitz矩阵的O(NlogN),并且相对另一种常用的后处理方法,最低有效位(LSBs)后处理,具有更高的随机数提取效率。实验中由所提后处理方法计算得到的随机数已通过美国国家标准与技术研究所(NIST)随机性检测。In practical applications of high-speed quantum random number generators,using Toeplitz matrices as a postprocessing method to extract the randomness of quantum random numbers has become a major technology roadmap.However,Toeplitz matrices are more suitable for hardware calculations than for software calculations and typically require that specialized field programmable gate array(FPGA)circuits be constructed for fast calculations.Based on the quantum random generator of spontaneous emission amplification(ASE),a fast post-processing method based on a simple hash function is proposed.The time complexity of this method is only O(N),which is less than O(NlogN)of a Toeplitz matrix,and compared with another commonly used post-processing method,least significant bit(LSB)post-processing has higher efficiency in random number extraction.The random number calculated by the proposed post-processing method in the experiment passes the randomness test of the national institute of standards and technology(NIST)in the United States.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7