期刊名称：International Journal of Computer Science Issues
印刷版ISSN：1694-0784
电子版ISSN：1694-0814
出版年度：2012
卷号：9
期号：4
出版社：IJCSI Press
摘要：In this paper we discuss the problem of testing randomness motivated by the need to evaluate of the quality of different random number generators which may not generate a true random numbers. Such number generators are used by many practical applications including computer simulations, cryptography, and communications industry, where the quality of the randomness of the generated numbers affects the quality of these applications. In this paper we concentrate with one of the most popular approaches for testing randomness, Poker test. In particular, two versions of Poker test are known: the classical Poker test and the approximated Poker test, where the latter has been motivated by the difficulties involved in implementing the classical approach at the time it is designed. Given a sequence of random numbers to be tested, the basic Poker approach divides this sequence into groups of five numbers, observes which of the possible patterns is matched by each quintuple, computes the occurring probability of each of these patterns, and finally applies Chi-square test to check the randomness of such sequence. In [11], we showed such approach can be implemented with no significant extra running time compared with the approximated approach. In this paper, motivated by certain practical applications such as cryptography and simulation we implement the classical Poker test (respectively, the corresponding approximated approach) that uses hands of four numbers instead of hands of five numbers. The numerical experiments applied hands of four numbers approach show that the running time is significantly less than those applied hands of five numbers approach.
关键词：Poker test; randomness; random numbers tests; cryptography; secret keys
