Browse > Article

New Randomness Testing Methods using Approximate Periods  

Lim, Ji-Hyuk (한양대학교 전자통신컴퓨터공학)
Lee, Sun-Ho (한양대학교 전자통신컴퓨터공학)
Kim, Dong-Kyue (한양대학교 전자통신컴퓨터공학)
Abstract
In this paper, we propose new randomness testing methods based on approximate periods in order to improve the previous randomness testing method using exact pattern matching. Finding approximate periods of random sequences enables us to search similarly repeated parts, but it has disadvantages since it takes long time. In this paper we propose randomness testing methods whose time complexity is O($n^2$) by reducing the time complexity of computing approximate periods from O($n^3$) to O($n^2$). Moreover, we perform some experiments to compare pseudo random number generated by AES cryptographic algorithms and true random number.
Keywords
Randomness test; Approximate period;
Citations & Related Records
연도 인용수 순위
  • Reference
1 FIPS PUB 140-1: Security requirements for cryptographic modules, NIST, 1994.
2 FIPS PUB 140-2: Security requirements for cryptographic modules, NIST, 2001.
3 SP 800-22: A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications, NIST, May, 15, 2001.
4 N. Kim, H.L. Obeyesekara and D.K. Kim, "Comparisons of True Random and Pseudorandom Number Testing," Conference Proceedings of Multimedia, Information Technology and its Applications (MITA 2008), pp.459-462, 2008.
5 L. Li, R. Jin, P.-L. Kok and H. Wan, "Pseudoperiodic partitions of biological sequences," BIOINFOMATICS, vol.20, no.3, pp.295-306, 2004.   DOI   ScienceOn
6 Testing Program for NIST SP 800-22, StsGui ver. 1.8
7 True Random Number Service, http://www.random.org