A new discrete Fourier transform randomness test

查看全文 作　　者：Meihui [1,2]CHEN;Hua [1]CHEN;Limin [1]FAN;Shaofeng [1,2]ZHU;Wei [3]XI;Dengguo [1]FENG

机构地区：[1]Trusted Computing and Information Assurance Laboratory, Institute of Software, Chinese Academy of Sciences;[2]University of Chinese Academy of Sciences;[3]Southern Power Grid Science Research Institute

出　　处：《Science China(Information Sciences)》索引2019年第62卷第3期,共16页

基　　金：supported by National Key R&D Program of China (Grant No. 2018YFB0904900);National Cryptography Development Fund (Grant Nos. MMJJ20170214, MMJJ20170211) 摘　　要：The randomness of random number generators(RNGs) is important for the reliability of cryptographic systems since the outputs of RNGs are usually utilized to construct cryptographic parameters.Statistical tests are employed to evaluate the randomness of the RNG outputs. The discrete Fourier transform(DFT) test is an important test item of the most popular statistical test suite NIST SP800-22. In the standard NIST DFT test and related improved studies, there exist accuracy and efficiency issues. First, the bit sequences generated by known good RNGs have a high probability to be rejected when the sequences are long or the sequence number is large, due to the deviation between the actual distribution of the test statistic values and the assumed normal distribution. Second, the long test time and high memory consumptions of the complex DFT test algorithm also affect its practicability. To solve these problems, we propose a new DFT test method for long sequences(106 or more bits). Different from the previous DFT test methods focusing on making the distribution of the test statistic values closer to the normal distribution, we reconstruct the statistic to follow the chi-square distribution. Our experiment result shows that our method has higher reliability in the two-level test, and could effectively reduce the test time and the memory consumptions.When applying our method on randomness test, the test efficiency has been increased to about 4 times for 106-bit sequences and 7 times for 107-bit sequences. In conclusion, our method has lower probability of making errors, and is more suitable for practical application scenarios. 关键词：statistical RANDOMNESS TEST discrete FOURIER transform TEST NIST SP800-22 TWO-LEVEL TEST CHI-SQUARE distribution

相关文献

参考文献（25）
引证文献（5）
耦合文献（2）

参考文献(25)

引证文献(5)

耦合文献(2)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

A new discrete Fourier transform randomness test

参考文献(25)

引证文献(5)

耦合文献(2)

用户提示