A new method for detecting binary random sequences in cryptography: First interval test for non-overlapping templates

Abstract

ABSTRACT: In the application of various fields of cryptography, the generation of the key should be random, because it directly determines the security of the system, so the detection of the random generation of the key is a crucial work in cryptography. Different detection methods detect different properties of sequences. The first interval test of non-overlapping templates introduced in this paper is mainly aimed at testing the frequency of the first interval of the specified template in the sequence. When the frequency of the first interval of the specified template conforms to the ideal distribution, the randomness hypothesis is accepted. On the contrary, the specific frequency the template, random hypothesis is rejected. This method focuses more on specifying the interval frequency of the occurrence of the template than some methods of checking the frequency of the occurrence of the template in the whole sequence. In addition, the sequence length examined by this detection method can be short or long. Compared with the random number detection method, the method introduced in this paper is more inclusive.