Abstract
A number of statistical tests have been recommended over the last twenty years for assessing the randomness of long binary strings used in cryptographic algorithms. Several of these tests include methods of examining subblock patterns. These tests are the uniformity test, the universal test and the repetition test. The effectiveness of these tests are compared based on the subblock length, the limitations on data requirements, and on their power in detecting deviations from randomness. Due to the complexity of the test statistics, the power functions are estimated by simulation methods. The results show that for small subblocks the uniformity test is more powerful than the universal test, and that there is some doubt about the parameters of the hypothesised distribution for the universal test statistic. For larger subblocks the results show that the repetition test is the most effective test, since it requires far less data than either of the other two tests and is an efficient test in detecting deviations from randomness in binary strings.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
