[1]YANG Xianwei,KANG Hongjuan,LIAO Zuhua.Study on optimization of poker test random sequences[J].CAAI Transactions on Intelligent Systems,2016,11(4):513-518.[doi:10.11992/tis.201606002]
Copy
Study on optimization of poker test random sequences
CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume:
11
Number of periods:
2016 4
Page number:
513-518
Column:
学术论文—机器感知与模式识别
Public date:
2016-07-25
- Title:
- Study on optimization of poker test random sequences
- Keywords:
- binary sequence; random sequence; pseudorandom bit generator; randomness test; poker test; encryption algorithms; efficiency analysis; incomplete gamma functions.
- CLC:
- TP18
- DOI:
- 10.11992/tis.201606002
- Abstract:
- The security of modern computer systems depends on binary random sequences, such as cipher algorithms 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 National 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.
- References:
-
[1] National Institute of Standards and Technology. NIST SP 800-22, A statistical test suite for random and pseudorandom number generators for cryptographic applications[S]. Revision 1a. Washington DC, USA:Information Technology Laboratory of National Institute of Standards and Technology, 2010.
[2] BSI AIS-20, AIS-30,. Application notes and interpretation of the scheme functionality classes and evaluation methodology for deterministic and physical random number generators[S]. Berlin, Germany:German Federal Office for Information Security, 2008.
[3] 随机性检测规范[S]. 中国北京:国家密码管理局, 2009. Randomness test specification[S]. Beijing:National Cryptography Administration, 2009.
[4] 罗影, 刘冬梅, 康红娟. NIST新分组密码工作模式及快速实现研究[J]. 通信技术, 2014, 47(9):1066-1070. LUO Ying, LIU Dongmei, KANG Hongjuan., NIST new block cipher modes of operation and their fast implementationoperation modes and their fast implementations of nist new block cipher[J]. Communications technology, 2014, 47(9):1066-1070.
[5] 杨先伟, 康红娟. SM3杂凑算法的软件快速实现研究[J]. 智能系统学报, 2015, 10(6):9541-9597. YANG Xianwei, KANG Hongjuan. Fast software implementation of SM3 hash algorithm[J]. CAAI transactions on intelligent systems, 2015, 10(6):9541-9597.
[6] CCSA. Specification of the 3GPP confidentiality and integrity algorithms 128-EEA3& 128-EIA3. Document 2:ZUC specification[S]. Cedex, France:CCSA, 2011.
[7] 冯秀涛. 3GPP LTE国际加密标准ZUC算法[J]. 信息安全与通信保密, 2011, 9(12):45-46.FENG Xiutao. ZUC algorithm:3GPP LTE international encryption standard[J]. Information security and communications privacy, 20112, 9(12):45-46.
[8] 罗影, 张文科, 尹一桦, 等. 单比特频数检测和块内频数检测的快速实现研究[J]. 通信技术, 2015, 48(9):1073-1077. LUO Ying, ZHANG Wenke, YIN Yihua, et al. Fast Implementation of monobit frequency test and frequency test within a block[J]. Communications technology,. 2015, 48(9):1073-1077.
[9] Edro M AALCOVER P M, GUILLAMóN A, RUIZ M D CAntonio G, et al. A new randomness test for bit sequences[J]. Informatica, 2013, 24(3):339-356.
[10] KAMINSKY A. GPU parallel statistical and cube test analysis of the SHA-3 finalist candidate hash functions. (2012-02-13). http://www.cs.rit.edu/~ark/parallelcrypto/sha3test01/.
- Similar References:
Memo
-
Last Update:
1900-01-01