الفهرس 
abstractsOnly 14 pages are availabe for public view
 |  | from | 36 |  |  |
| | | from | 36 | | |
Abstract
Measuring the quality of randomness of a given sequence is a crucial problem that significantly affects the quality of many practical applications such as queue simulation, and cryptography. That is, generated sequences should be subjected to a variety of statistical tests designed to detect the specific property expected of random sequences.
In this thesis we study Poker test, one of the most popular approaches for testing randomness. In particular, we design and implement a Poker test program using C++ language. We compare the performance of implementing two versions of Poker test, the classical and the modified Poker tests. We show that the classical Poker test can be implemented with no significant extra running time compared with the modified Poker test. These results encourage the using of the classical test over the modified one.