智能系统学报2016，Vol.11Issue(4)：513-518,6.DOI:10.11992/tis.201606002
随机序列的扑克检测优化研究
Study on optimization of poker test random sequences
摘要
Abstract
The security of modern computer systems depends on binary random sequences, such as cipher algo⁃rithms keys, RSA algorithm prime numbers, the digital signature system, the identity authentication system, etc. Randomness tests analyze and test the randomness of sequences, using probability and statistics. The Chinese Na⁃tional Cryptography Administration has released national randomness test specifications and the Poker test is one of these. This paper analyzed the reasons for the low efficiency of the Poker test, then proposes a fast implementation algorithm. This new algorithm deals with bytes by making full use of CPU word length, integrates the detection process, and reduces some unnecessary operations under the conditions when m equals 4 and 8. At the same time, the method reduces and optimizes the computation and assessment of statistical quantity, avoiding computation of incomplete gamma functions. The results show that the efficiency of the new algorithm increases 9.5 fold.关键词
二元序列/随机序列/随机数发生器/随机性检测/扑克检测/密码算法/效率分析/余不完全伽玛函数Key words
binary sequence/random sequence/pseudorandom bit generator/randomness test/poker test/encryp-tion algorithms/efficiency analysis/incomplete gamma functions分类
信息技术与安全科学引用本文复制引用
杨先伟,康红娟,廖祖华..随机序列的扑克检测优化研究[J].智能系统学报,2016,11(4):513-518,6.基金项目
国家自然科学基金项目（61170121，11401259）；江苏省自然科学基金项目（ BK20151117）． （）
