<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Autocorrelation Criterion for Quality Assessment of Random Number Sequences</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Cherkasy State Technological University</institution>
          ,
          <addr-line>Shevchenko Blvd., 460, Cherkasy, 18006</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2046</year>
      </pub-date>
      <fpage>0000</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>The authors analyze different approaches to forming estimates of autocorrelation coefficients of random and pseudorandom number sequences. An integral estimate of normalized autocorrelation coefficients is theoretically obtained. Estimates of some statistical properties of normalized autocorrelation coefficients have been improved. The autocorrelation criterion for quality assessment of time series based on simultaneous analysis of several autocorrelation coefficients has been further developed by adapting it to uniformly distributed random variables. The technique of its implementation is presented. Applying the criterion revealed statistical deviations for some pseudorandom number generators that successfully pass all TestU01 autocorrelation tests.</p>
      </abstract>
      <kwd-group>
        <kwd>Random numbers ꞏ Random number generator ꞏ Time series ꞏ Correlation ꞏ Autocorrelation ꞏ Quality assessment ꞏ Statistical criterion</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Since random number sequences are multi-parameter processes, different methods
and criteria are used for assessing their quality. These methods and criteria consider
random processes from different standpoints using different statistical estimates.</p>
    </sec>
    <sec id="sec-2">
      <title>The most famous test suits are: the Donald Knuth’s statistical tests set [1]; George Marsaglia’s DIEHARD tests [2]; NIST Statistical Test Suite [3]; TestU01[4]. In addition, there are other packages and tests. Among them CRYPT-X [5], NIST PUB FIPS 140-2 [6] can be distinguished.</title>
    </sec>
    <sec id="sec-3">
      <title>Based on the definition of discrete white noise [7], an autocorrelation test is one of the most common tests, which allow detecting statistical irregularities of the studied sequences of numbers.</title>
    </sec>
    <sec id="sec-4">
      <title>In [1], as in [8], it is recommended to use the criterion of serial (cyclic) correlation</title>
      <p>between cyclically shifted copies of the studied sequence. In [4, 9, 10], estimates of
autocorrelation coefficients are formed by comparing two subsequences. The count of</p>
    </sec>
    <sec id="sec-5">
      <title>Copyright © 2020 for this paper by its authors. Use permitted under Creative</title>
    </sec>
    <sec id="sec-6">
      <title>Commons License Attribution 4.0 International (CC BY 4.0).</title>
      <p>the subsequences’ elements is made from the beginning and from the end of the
studied sequence. In [11], the autocorrelation coefficients are calculated for sequence
successive intervals, which can overlap or stand away from each other.</p>
    </sec>
    <sec id="sec-7">
      <title>Thus, there are different approaches to finding empirical autocorrelation coeffi</title>
      <p>cients that form an autocorrelation function (ACF) estimate. However, the main task
of the autocorrelation test is to determine the correspondence of the sequence ACF
estimate to the ACF of random number sequence described by the Dirac delta
function [12]. Thus, estimates of the autocorrelation coefficients at non-zero points should
go to zero. Their significance is most often evaluated by the Student's criterion [13].</p>
    </sec>
    <sec id="sec-8">
      <title>The authors of the work [4] verify the correspondence of the distribution of autocorrelation coefficients estimates at nonzero points to the binomial law. For a large number of values, it can be approximated to normal.</title>
    </sec>
    <sec id="sec-9">
      <title>In [14, 15] the statistical criteria of ACF side lobes complex estimate are proposed.</title>
      <p>Instead of testing the significance of each individual autocorrelation coefficient, these
criteria check several autocorrelation coefficients to be different from zero. However,
the proposed criteria are not adapted to analyze sequences of uniformly distributed
random and pseudorandom numbers.</p>
    </sec>
    <sec id="sec-10">
      <title>Thus, the question of estimating autocorrelation coefficients needs further study. This leads to the need for deeper analysis to identify the correlation properties inherent in sequences generated by natural sources of discrete white noise and not inherent in artificially generated pseudorandom sequences (PRS).</title>
    </sec>
    <sec id="sec-11">
      <title>The purpose of this work is to develop a criterion for assessing the quality of sequences of uniformly distributed random and pseudorandom numbers, which allows detecting statistical irregularities not detected to date.</title>
      <p>2</p>
      <p>Formal Problem Statement
According to [16], the normalized autocorrelation coefficient  x t ', t '' of a random
process X t  is calculated in the general form according to the expression:
 X t ', t ''  K X t ', t ''  Var  X t '  Var  X t ''  ,
where K X t ', t ''  E  X t '  E  X t '    X t ''  E  X t ''  is the correlation
moment (covariance coefficient) of the intersections X t ' and X t '' of the random
process X t  at times t ' and t ''  t ' ; E  X t ' , E  X t '' , Var  X t ' ,
Var  X t '' are the expectations and the variances of X t ' , X t '' . We will
represent the intersections X t ' and X t '' as random variables (r.v.) X ' and X '' .</p>
    </sec>
    <sec id="sec-12">
      <title>Then</title>
      <p>E  X t '  E  X ' ,
E  X t ''  E  X '' ,
Var  X t '  Var  X ' ,
Var  X t ''  Var  X '' .</p>
    </sec>
    <sec id="sec-13">
      <title>Suppose that random number generator (RNG) or pseudorandom number generator (PRNG) forms a stationary random process. For such a process,</title>
      <p>E  X '  E  X ''  mX  const , Var  X '  Var  X ''   X2  const , and an
autocorrelation coefficient depends only on the lag   t '' t ' : K X t ', t ''  kX   .</p>
      <p>Let</p>
      <p>X '  X ' E  X ' ,</p>
      <p>X ''  X '' E  X ''
be
r.v.</p>
      <p>with
expectations
E  X '  E  X ''  0 and variances Var  X '  Var  X ''   X2 . Then the
correla   
       
tion moment kX    E  X ' X '' and the normalized autocorrelation coefficient

 
 X    kX    Var  X '  Var  X ''   E  X ' X ''  X2 .

 </p>
    </sec>
    <sec id="sec-14">
      <title>Suppose that the r.v. X ' and X '' are uncorrelated (this corresponds to the proper</title>
      <p>ties of white noise intersections) and independent. Then the  X   value is invariant
to the value of   0 and  X   0  0 [9].</p>
    </sec>
    <sec id="sec-15">
      <title>The product of r.v.   X ' X '' can be considered as a r.v. with parameters:</title>
      <p>E    E  X '  E  X ''  0
  
   
and</p>
      <p> 2 
Var    E  2   E2    E  X ' X ''  
  
 2   2     
 E  X '   E  X ''   Var  X ' Var  X '' or Var     X4 , and     X2 . In this
       
case  X    E     .</p>
      <sec id="sec-15-1">
        <title>If values of a discrete random process  t  form a countable set of independent</title>
        <p>values 1,  2 ,, n , then E    lim 1 n in1i  .
n</p>
      </sec>
    </sec>
    <sec id="sec-16">
      <title>According to the Lindeberg-Levy theorem [16], if mutually independent r.v.</title>
      <p>1,  2 ,, n , are equally distributed and have an expectation E    a and a
variance  2 , then the value in1i  na   n is normally distributed when n   :
in1i  na    n  N 0;1 . Given that E    a  0 ,
in1i  na   n  n 1 n  in1 i    n E      n X    N 0;1 .</p>
    </sec>
    <sec id="sec-17">
      <title>In other words, the marginal distribution of the normalized autocorrelation coeffi</title>
      <p>cient  X   of a random process whose intersections are independent r.v., is a
normal distribution with expectation E  X    0 and variance Var  X    1 n .
has a distribution  2 with  degrees of freedom n   :
n1 X2     2 .</p>
      <p></p>
      <sec id="sec-17-1">
        <title>Then for side lobes power nW    2 .</title>
        <p></p>
      </sec>
    </sec>
    <sec id="sec-18">
      <title>Thus, expression (2) is an integral estimate for autocorrelation coefficients. It creates the preconditions for constructing statistical criteria for checking the correlation properties of sequences of random and pseudorandom numbers by their empirical estimates.</title>
      <p>
        Normalized autocorrelation coefficients are strictly defined by the theoretical
expression (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ). However, the correlation properties estimate of empirical number
sequence can significantly depend on the studied sequence properties and the
experiment conditions. In particular, the sequence correlation properties estimate can be
performed:
─ on a sequence period in the case of its periodicity, by analyzing a periodic ACF
(PACF);
─ on some fixed size sample;
─ in real time, when sequence elements arrive to the analyzer sequentially.
In addition, the estimating correlation properties of random and pseudorandom
number sequences may be conducted under conditions where the distribution law of a
discrete random variable (d.r.v.) and its parameters are either fully known or
empirically determined. In all these cases, it is necessary to know the first and second initial
moments of normalized autocorrelation coefficients for their integral estimate.
      </p>
    </sec>
    <sec id="sec-19">
      <title>We estimate these statistical properties of the normalized autocorrelation coefficients of a discrete random process calculated according to the defined approaches.</title>
      <p>Estimate of Statistical Properties of Normalized
Autocorrelation Coefficients</p>
      <sec id="sec-19-1">
        <title>Periodic ACF Estimate</title>
        <p>ACF is periodic if an original sequence is also periodic. Moreover, as it shown in
[17], it is advisable for periodic signals to estimate the probabilistic moments in the
minimum period. Taking into account the symmetry property of the PACF graph with
respect to the axis, which is half period from the y-axis, it is allowed to reduce the
number of calculated values by 2 times.</p>
        <sec id="sec-19-1-1">
          <title>Let the number sequence  x0 , x1,, xn1  be repeated periodically with period n .</title>
          <p>In this case, as shown in [1] and [8], the estimate of the normalized autocorrelation
coefficient is calculated according to the expression:
rPACF x   
 in01  xi  x    xi mod n  x 
 in01 xi  x
2
  n i0 xi xi mod n    i0 xi 
n1 n1
2
n1
where x   i0 xi n is a statistical estimate of the X expectation.
ance:  x2   in01 xi  x </p>
          <p>
            Note that the estimate (
            <xref ref-type="bibr" rid="ref3">3</xref>
            ) is performed for the whole sequence period. Therefore,
the estimate of the d.r.v. X expectation coincides with the expectation:
x   i0 xi n  lim  x   i0 xi m  E  X  . Based on similar considerations, the
n1 m
          </p>
          <p>
            m
variance estimate over the entire sequence period also coincides with the d.r.v.
vari2 2
n  lim   im0  xi  E  X 
m
m  Var  X    X2 . Then the
expression
(
            <xref ref-type="bibr" rid="ref3">3</xref>
            )
can
be
represented
as
rPACF x    1 n   in01  xi  E  X    xi  mod n  E  X   X2 .
          </p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-20">
      <title>Obviously, given the symmetry property of the PACF graph, the analysis of auto</title>
      <p>correlation coefficients estimates is advisable to perform for   0;n 2  1 .</p>
      <p>
        According to [1], E  rPACF x    1  n 1 . The upper bound estimate of
variance of rPACF x   calculated from (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) for arbitrary independent variables is:
Var  rPACF x   
      </p>
      <p>n2
 n 12  n  2
. However, Varnorm  rPACF x   </p>
      <p>
        n  n  3
 n  1  n 1
for
the
normal
distribution
of
the
initial
values,
and
Varunif  rPACF x    24 n2  O  n7 3 log  n  [1] for their uniform distribution. In
5
addition, as shown in [19], the value rPACF x   is distributed asymptotically normal
even for sufficiently small samples  n  10 . In [1] it is recommended that the
estimate
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
should
be
between
      </p>
      <p>E rPACF x    2 Var  rPACF x  
and
E rPACF x    2 Var rPACF x   for uncorrelated values  x0 , x1,, xn1  .
3.2</p>
      <p>ACF Estimate on Fixed Size Sample
ACF estimate on some fixed size sample  x0 , x1,, xn1  is widely used in
econometrics for constructing regression models [14, 15]. In addition, a similar ACF estimate is
used to investigate sequence properties in the aperiodic mode typical to information
transmission in communication systems [20]. In this case, the estimate of normalized
ACF is calculated according to the expression [21]:</p>
      <p>
        n1  xi  E  X    xi  E  X  1 n  in01 xi  E  X 2  (
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
rx*    1  n    i0
for a known a priori value of E  X  , or the expression [21]:
n1  xi  x   xi  x 1 n  in01 xi  x  .
2
rx**    1 n    i0
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
In [21] it is shown that if the random vectors  xi , xi  are independent and equally
distributed, then the distribution law of the value rx*   (as well as rx**   ) has an
asymptotic normal distribution.
      </p>
    </sec>
    <sec id="sec-21">
      <title>Various authors use or recommend to use for (5) the value of zero as an approxi</title>
      <p>
        mate estimate of its expectation and the value of n1 2 [14] or n n  2 n  1 2
[15] as an approximate estimate of its root-mean-square deviation. However, the exact
value of the rx**   expectation is defined in [22] and is equal to
E rx**     n 11 . The upper bound of the estimate (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) variance is defined in
[23] for any law of distribution of the initial values xi  :
      </p>
      <p>Var rx**   
n4    7 n3  7  16 n2  2  2  9  6 n  4   4
n n 12 n  2 n  3
.</p>
      <p>In
addition,
in
[23]
it
is
also
shown
Varnorm rx**     n4    3 n3  3 n2  2   1 n  4 2  n  1 n2 n 12 
that
for
normally distributed r.v., and the expression Var rx**    n   /  n  n  2 from
[15] is valid in the case of a known expectation E  X  , that is, for the value rx*   .</p>
    </sec>
    <sec id="sec-22">
      <title>Consider the normalized ACF estimate, which is given, for example, in [9] or [10]:</title>
      <p>rx***     in01  xi  x    xi  x
 in01  xi  x2   in01  xi  x 2 .</p>
      <p>
        (
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
Let us extend and present more fully the results of estimates of expectation
E  rx***   and variance Var  rx***   obtained in [24].
      </p>
      <p>The r***   distribution law for independent and equally distributed random
vecx
tors  xi , xi  is an asymptotic normal distribution [25]. This statement is also
confirmed by [26, 27]. They show that the distributions of correlation analysis statistics
are resistant to deviations of the observed multidimensional law from normal. The
empirical distributions of these statistics are well described by the boundary laws
obtained from the assumption of normality of the observed values.</p>
      <p>To find E  rx***   , we use the methodology described in [22].</p>
      <p>Let zi  xi  x . Then  i0 zi   in01 xi  x   i0 xi  n x  0 .</p>
      <p>n1 n1

E  rx***    E 
</p>
      <p> in01inz01i2 zi zini01 zi2   E   n  in01zi zi2zi   n  E  zi inz01izi2  
 n 11  E   i j inz01izi2z j   </p>
      <p>1
n 1
 E    i0 zi in01zi2 i0 zi     n 11 .</p>
      <p> n1 2 n1 2 </p>
      <p>The variance Var  rx***   can be calculated according to the well-known
expression: Var  rx***    E  rx***  2   E 2  rx***   .</p>
      <p>As it shown in [23],
  i0
n1
zi zi    i0 zi zi  2 i0
2 n1 2 2 n12
zi zi2 zi2 
zi zi z j z j . </p>
      <p>* *
are different. In addition, for the symmetric joint distribution of values z0 ,, zn1 ,
means a summation for i, j  1,, n  , and i, i  , j, j 
E  rx***  2   E  ni10 zi2  ni10
2 1  n   z12 z22  2  n   z12 z2 z3   
zi   
   n  2  2  n  2    n   z1z2 z3 z4 </p>
      <p>
 n  n1 2 2  n nn1 * zi2 z 2j 
 E  n i0 zi    n nn212 nn  22 n n3 </p>
      <p>2  n  2 
n  n 1  n  2</p>
      <p>* 2 
 zi z j zk 

 ,



*
 zi z j zk zl
where *</p>
      <p>denotes a summation for all different indices from 0 to n 1 .</p>
    </sec>
    <sec id="sec-23">
      <title>Using an equality</title>
      <p>Sr  in01 zir
for
r  1 ,
and
* zi2 z 2j  S22  S4 ,
* zi2 z j zk  2S4  S22 , and * zi z j zk zl  3S22  6S4 from [28], by analogy with [23],
 n3    3 n2   n  6  M S4 S22  
n 
E rx***  2    n2 n   4  3 n    3 n    .</p>
      <p>n 1 n  2  n  3 n  2</p>
      <sec id="sec-23-1">
        <title>As shown in [23, 29], 1 n  S4 S22  1 for any distribution law of r.v. zi . Then, by</title>
        <p>
          analogy with [23], it is possible to obtain the variance upper bound of the correlation
coefficient estimate (
          <xref ref-type="bibr" rid="ref6">6</xref>
          ). To do this, replacing E S4 S22  by 1 n we get
E rx***  2   n4  n3   5  n2 4  6  n 3 2  4   6 2 . Then
n 1n  2 n  3 n  2
Var rx***   
n5  n4   7  n3 7  16  n2 2 2 18 12  n 4 2 16 
        </p>
        <p>
           n 12  n  2 n  3 n  2
According to [22], for normally distributed r.v. xi , E S4 S22   3 n 1  n n  1 ,
. (
          <xref ref-type="bibr" rid="ref7">7</xref>
          )
(
          <xref ref-type="bibr" rid="ref8">8</xref>
          )
Varnorm rx***   
n4    3 n3  3 n2  2  1 n  4 2
 n  1 n 12  n  2
.
        </p>
        <p>One can notice that Varnorm rx***   nn1 n   . In addition, in the general case
Var rx***   
1  7 n 16 n2 12 n3  2  1  n  2  n3 n  
1 1 n2 1 2 n 1 3 n n  
nn n 1 .</p>
        <p>
          Thus, the obtained results are in full agreement with [10]. The variance of the
estimate (
          <xref ref-type="bibr" rid="ref6">6</xref>
          ) is asymptotically equal to 1  n   if n is large. However, the estimates (
          <xref ref-type="bibr" rid="ref7">7</xref>
          )
and (
          <xref ref-type="bibr" rid="ref8">8</xref>
          ) are more accurate.
        </p>
      </sec>
    </sec>
    <sec id="sec-24">
      <title>We denote the relative error of approximation of the autocorrelation coefficient es</title>
      <p>timate variance Var  rx***   by  n,   Var rx***   1 n   Var rx***   .
Analysis of the dependency  (n, ) graph for n  50;100 ,   1; 25 (Figure 1)
indicates that  (n, )  max for   max , n  min . In particular,
 100,1  1.02 104 ,  100, 25  1.578 103 , and  50, 25  0.02 . It is also worth
noting that min  n,    n,1 for a fixed value of n .
The graph of the relative error of approximation of the autocorrelation coefficient
estimate variance Varnorm  rx***   for normally distributed r.v. xi
 norm  n,   Varnorm rx***   1 n   Varnorm rx***  
n  50;100 ,   1; 25 is shown in Figure 2.
depending
on
For the specified definition area  norm n,   max for   min , n  min . In
particular,  norm 100,1  0.021 ,  norm 100, 25  0.019 , and  norm 50,1  0.042 .
However, in the general case max  norm  n,    norm  nmin ,  for a fixed value of  . In
Figure 2, this situation is observed for   21; 25 .
When analyzing the correlation properties of a random number sequence, any shift of
the analyzed sequence belongs to the set xi t  of realizations of a stationary
discrete random process X t  . In other words, the "zero" point for the beginning of
realization may be arbitrary. In this case, we can consider a set of realizations
xi t  : xi t   xi j t  j  . To enable autocorrelation coefficients practical analysis,
we will assume sequences of n numbers, the first of which are formed at times
t  0,1, 2, , by realizations of a random process X t  . This approach is most
effective when the correlation properties of a random number sequence are analyzed in real
time, not by some fixed size sample. In this case, the sequence elements are written to
a limited size buffer (this approach is similar to the sliding window method).</p>
      <p>We denote the element of a random number sequence at a discrete time t by xt .
Then the estimate of the normalized autocorrelation coefficient of order  is as
follows:
rx   
in01  xti  x t    xt i  x t  </p>
      <p>
        
in01 xti  x t 2  in01 xt i  x t  
2
,
(
        <xref ref-type="bibr" rid="ref9">9</xref>
        )
n1 n1
where x t   1 n   i0 xti , x t    1 n  i0 xt i are the average sample values
of random process intersections X t  , X t   . Note that for a stationary random
process, equality lim  P  x t   x t       1 is satisfied for any small   0 .
      </p>
      <p>n</p>
      <sec id="sec-24-1">
        <title>The distribution law of the estimate r  rx   (9) for independent and equally dis</title>
        <p>tributed random vectors  xti , xt i  is asymptotically normal [25] with expectation
   x   and variance [30]</p>
        <p>Var rx    4n2   24200   00224 
are the theoretical central moments of the order k
and
m :
 km   xti  E  xti k  xt i  E  xt i  .</p>
        <p>m</p>
      </sec>
    </sec>
    <sec id="sec-25">
      <title>According to [30],</title>
      <p>Var rx    1   2 2 n in the case of a normally distributed population.</p>
    </sec>
    <sec id="sec-26">
      <title>However, as shown in [30], applying the Fischer logarithmic transformation [31] to</title>
      <p>the sample correlation coefficients r leads to the following conclusions. The value
z  1 2 ln 1  r  1  r  should be considered normally distributed with an average
 1  1 r   1  1      
  n  3  2 ln  1  r    2 ln  1     2  n 1   is normal: 
N 0;1 .</p>
      <p>Thus,  X    0 for independent and equally distributed random vectors
 xti , xt i  , the value x    n  3 2 ln 1 rx   1  rx   has a standard

normal distribution, and  x  2   2</p>
      <p>
 1
3.4</p>
      <p>ACF Estimate for Uniformly Distributed
Number Sequences with Known Parameters</p>
      <sec id="sec-26-1">
        <title>Random/Pseudorandom</title>
        <p>Often, sequence statistics are checked at the output of a generator of uniformly
distributed random or pseudorandom numbers in some range a, b (such generators are
most widely used for information security tasks as key entropy generators). Then the
simplest analysis of the studied sequence allows us to determine the set of d.r.v.
values at the generator output. If there is a sequence of numbers xi  A from the
alphabet A , then its cardinality N  max xi   min xi  1 , the range of d.r.v. values
X  min xi ; max xi  , its expectation E  X    min xi   max xi  2 , and its
variance Var  X    N 2 1 12 .</p>
      </sec>
    </sec>
    <sec id="sec-27">
      <title>A similar estimate can be made if the size of the analyzed number sequence sig</title>
      <p>nificantly exceeds the capacity of the alphabet. Otherwise there is a possibility to
incorrectly define the lower or upper limit of d.r.v. values set. The probability that the
minimum or the maximum value of N -symbol alphabet will not be present in a
sequence of V symbols is equal to Per  2  N 1 N n .</p>
      <p>Thus, for the given values of alphabet capacity M and probability Per , it is
possible to calculate the required sample size V  logN 1 N Per 2 .</p>
      <p>For example, for N  256 and Per  1010 we get: V  log11 256 1010 2  6061 .</p>
      <sec id="sec-27-1">
        <title>For known parameters (expectation E  X  and variance Var  X  ) of a random process X t  , the estimate of normalized ACF can be calculated by the expression</title>
        <p>
          rx '   1 n  in01  xti  E  X    xt i  E  X  Var  X  .
(
          <xref ref-type="bibr" rid="ref10">10</xref>
          )
In this case, for independent values xi , as well as in accordance with the regularities
stated in (
          <xref ref-type="bibr" rid="ref1">1</xref>
          ) and (
          <xref ref-type="bibr" rid="ref2">2</xref>
          ), and n   , rx '   N 0;1 n , lim 1 rx '     n ,
2
n
For
side
lobes
power
of
        </p>
        <p>
          ACF
estimate
(
          <xref ref-type="bibr" rid="ref10">10</xref>
          ),
lim W '   n and the expression (
          <xref ref-type="bibr" rid="ref11">11</xref>
          ) can be rewritten as follows:
n
W '  1 rx ' 
(12)
Applying the Criterion for Estimating Uniformly Distributed
Random Number Sequences
We implement the developed criterion for known PRNG, which pass all tests of the
TestU01 test package [4]. For this purpose we conduct N  1000 independent tests.
We define the value nW ' . Then calculate the relative frequency of the event
A  nW '  12 , .
        </p>
        <p>
          In this case, the statistical criterion for corresponding an ACF estimate of uniformly
distributed random number sequence to the white noise ACF provides calculating the
normalized autocorrelation coefficients from (
          <xref ref-type="bibr" rid="ref10">10</xref>
          ), forming an estimate of the side
lobes power W ' , and then estimating it with (12).
        </p>
        <p>Description of the Criterion for Estimating Uniformly</p>
        <p>
          Distributed Random Number Sequences
The criterion for estimating uniformly distributed random number sequences is the
following:
1. if the d.r.v. definition area is unknown, it is empirically determined;
2. the d.r.v. expectation and variance are calculated;
3. using the expression (
          <xref ref-type="bibr" rid="ref10">10</xref>
          ), the sequence of estimates rx '  of normalized
autocorrelation coefficients is calculated for  1;  ;
4
5
4. the side lobes power W '  1 rx '  of the ACF estimate is calculated;
2
5. if the value nW ' for the selected level of significance does not exceed the
quantile 12 , of chi-square distribution with  degrees of freedom, the null
hypothesis is accepted. It is that the numbers of the sequence under study are random.
        </p>
      </sec>
    </sec>
    <sec id="sec-28">
      <title>Otherwise, the null hypothesis is rejected.</title>
    </sec>
    <sec id="sec-29">
      <title>We denote by Q the value that in each specific test takes a value of 1 if the event</title>
      <p>A is true and 0 if the event A is false. Then the relative frequency of the event
A  nW '  12 , in N independent tests is p*  iN1Qi N .</p>
      <sec id="sec-29-1">
        <title>The expectation of the relative frequency is E  p *  1  , its variance is</title>
        <p>Var  p *   1  N . Then the inequality p *  1    t  1   N is
satisfied with probability  , where t is the quantile of standard normal distribution with
level  . In other words, the calculated relative frequency p * falls within the
confidence interval 1   t  1   N ;1   t  1  N  with probability  .</p>
      </sec>
    </sec>
    <sec id="sec-30">
      <title>For testing we will choose     0.05 . Then the confidence interval for p * is</title>
      <p>0.9365; 0.9635 . The test results are summarized in Table 1.</p>
    </sec>
    <sec id="sec-31">
      <title>The results indicate that some of the generators that successfully pass all the</title>
    </sec>
    <sec id="sec-32">
      <title>TestU01 autocorrelation tests do not meet the developed criterion.</title>
      <p>6</p>
      <p>Conclusions
The study has produced the following results:
─ integral estimate of normalized autocorrelation coefficients (ACF side lobes) is
theoretically obtained. This provides the basis for building statistical criteria for
verifying correlation properties of random and pseudorandom number sequences
by their empirical estimates;
─ the first and second initial moments of estimates of normalized autocorrelation
coefficients are presented for: PACF; ACF of fixed size sample calculated
according to different approaches (for example, presented in [9, 10, 21]); "sliding
window" ACF for long period sequences;
─ the upper bound of the variance of estimates of normalized autocorrelation
coefficients calculated by [9] or [10] is clarified. This allows increasing the accuracy of</p>
    </sec>
    <sec id="sec-33">
      <title>ACF side lobes integral estimate;</title>
      <p>─ the criterion for estimating autocorrelation of time series based on simultaneous
analysis of several autocorrelation coefficients (similar to the Box-Pierce [14] and</p>
    </sec>
    <sec id="sec-34">
      <title>Ljung–Box [15] criteria) has been further developed by adapting it to uniformly</title>
      <p>distributed r.v. This made it possible to perform a complex estimate of ACF for
sequences of uniformly distributed random and pseudorandom numbers;
─ applying the criterion revealed statistical deviations for some PRNG that
successfully pass all TestU01 autocorrelation tests.
12. Dirac, P.A.M.: The principles of quantum mechanics. London, OUP (1958). doi:
10.1063/1.3062610
13. Bolshev, L.N., Smirnov, N.V.: Tables of mathematical statistics. Moscow, Nauka (1983)
(in Russian)
14. Box, G.E.P., Pierce, D.A.: Distribution of residual autocorrelations in
autoregressiveintegrated moving average time series models. Journal of the American Statistical
Association, 65, no. 332, 1509–1526 (1970). doi: 10.1080/01621459.1970.10481180
15. Ljung, G.M., Box, G.E.P.: On a measure of lack of fit in time series models. Biometrika,
65, no. 2, 297 (1978). doi: 10.1093/biomet/65.2.297
16. Wentzel, Ye.S., Ovcharov, L.A.: Applied problems of probabilities theory. Moscow, Radio
and Communication (1983) (in Russian)
17. Kuznetsov, V.M.: Generators of random and pseudorandom sequences on digital delay
elements (basics of theory and methods of construction). Thesis for doctor of technical
sciences degree. Kazan, Kazan State Technical University (2011) (in Russian)
18. Dixon, W.J.: Further contributions to the problem of serial correlation. Ann. Math. Statist.,
15, no. 2, 119–144 (1944). doi: 10.1214/aoms/1177731279
19. Lemeshko, B.Yu., Komissarov, A.S., Shcheglov, A.Ye.: Application of tests for trend
detection and checking for randomness. Metrology, 12, 3–25 (2010) (in Russian)
20. Varakin, L.E.: Communication systems with noise-like signals. Moscow, Radio and</p>
      <p>
        Communication (1985) (in Russian)
21. Anderson, T.W., Walker, A.M.: On the asymptotic distribution of the autocorrelations of a
sample from a linear stochastic process. The Annals of Mathematical Statistics, 35, no. 3,
1296–1303 (1964). doi: 10.1214/aoms/1177703285
22. Moran, P.A.P.: Some theorems on time series: II the significance of the serial correlation
coefficient. Biometrika, 35, no. 3/4, 255–260 (1948). doi: 10.1093/biomet/35.3-4.255
23. Dufour, J.-M., Roy, R.: Some robust exact results on sample autocorrelations and tests of
randomness. Journal of Econometrics, 29, no. 3, 257–273 (1985). doi:
10.1016/03044076(85)90155-1
24. Faure, E.V.: Statistical characteristics of estimates of normalized autocorrelation
coefficients of (pseudo) random number sequences. In: All-Ukrainian Scientific and Practical
Internet Conference on Automation and Computer-Integrated Technologies in Production
and Education: State, Achievements, Prospects of Development, pp. 46-47. Cherkasy
(2015) (in Russian)
25. Orlov, A.I.: Applied statistics. Moscow, Examen (2004) (in Russian)
26. Lemeshko, B.Yu., Pomadin, S.S.: Correlation analysis of observations of
manydimensional random variables under violation of normality assumptions. Siberian Journal
of Industrial Mathematics, 5, no. 3 (
        <xref ref-type="bibr" rid="ref11">11</xref>
        ), 115-130 (2002) (in Russian)
27. Pomadin, S.S.: Investigation of statistics distributions of multidimensional data analysis in
violation of normality assumptions, dissertation. Thesis for candidate of technical sciences
degree. Novosibirsk, Novosibirsk State Technical University (2004) (in Russian)
28. Kendall, M.G., Stuart, A., Ord, J.K.: The advanced theory of statistics. 4 ed. V. 3: Design
and analysis, and time-series. London: C. Griffin &amp; Company limited (1983)
29. Moran P.A.P.: Testing for serial correlation with exponentially distributed variates.
Biometrika, 54, no. 3/4, 395–401 (1967). doi: 10.1093/biomet/54.3-4.395
30. Kramer, G.: Mathematical methods of statistics, 2 ed. Moscow, Mir (1975)
31. Fisher, R.A.: On the probable error of a coefficient of correlation deduced from a small
sample. Metron, 1, 3–32 (1921)
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Knuth</surname>
            ,
            <given-names>D. E.</given-names>
          </string-name>
          :
          <source>The Art of Computer Programming: Seminumerical Algorithms</source>
          , 3 ed.,
          <source>vol. 2</source>
          . Boston, Addison-Wesley Longman Publishing Co., Inc. (
          <year>1997</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Marsaglia</surname>
          </string-name>
          , G.:
          <article-title>DIEHARD Battery of Tests of Randomness</article-title>
          . http://www.stat.fsu.edu/pub/diehard
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Bassham</surname>
            ,
            <given-names>L. E.</given-names>
          </string-name>
          et al.:
          <article-title>A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications</article-title>
          . SP 800-
          <issue>22</issue>
          <year>Rev</year>
          .
          <year>1a</year>
          .,
          <string-name>
            <surname>Gaithersburg</surname>
            ,
            <given-names>MD</given-names>
          </string-name>
          , United
          <string-name>
            <surname>States</surname>
          </string-name>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>L</given-names>
            <surname>'Ecuyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Simard</surname>
          </string-name>
          ,
          <string-name>
            <surname>R.:</surname>
          </string-name>
          <article-title>TestU01: A C library for empirical testing of random number generators</article-title>
          .
          <source>ACM Transactions on Mathematical Software</source>
          .
          <volume>33</volume>
          , no.
          <issue>4</issue>
          ,
          <fpage>22</fpage>
          -
          <lpage>es</lpage>
          (
          <year>2007</year>
          ). doi:
          <volume>10</volume>
          .1145/1268776.1268777
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Caelli</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dawson</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nielsen</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gustafson</surname>
          </string-name>
          , H.:
          <article-title>CRYPT-X Statistical Package Manual, Measuring the strength of Stream and Block Ciphers</article-title>
          . Queensland University of Technology (
          <year>1992</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <article-title>Security requirements for cryptographic modules</article-title>
          .
          <source>US standard FIPS PUB 140-2</source>
          (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Papoulis</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pillai</surname>
            ,
            <given-names>S. U.</given-names>
          </string-name>
          :
          <article-title>Probability, random variables, and stochastic processes</article-title>
          , 4th ed. Boston,
          <string-name>
            <surname>McGraw-Hill</surname>
          </string-name>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Ivanov</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chugunkov</surname>
            ,
            <given-names>I.V.</given-names>
          </string-name>
          :
          <article-title>Theory, application and quality evaluation of pseudorandom sequence generators</article-title>
          . Moscow, Kudits-Obraz (
          <year>2003</year>
          )
          <article-title>(in Russian)</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Smirnov</surname>
            ,
            <given-names>N.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dunin-Barkovsky</surname>
            ,
            <given-names>I.V.</given-names>
          </string-name>
          :
          <article-title>Course in probability theory and mathematical statistics for technical applications</article-title>
          . Moscow, Nauka (
          <year>1969</year>
          )
          <article-title>(in Russian)</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Kendall</surname>
            ,
            <given-names>M.G.</given-names>
          </string-name>
          :
          <article-title>The advanced theory of statistics</article-title>
          , vol.
          <volume>2</volume>
          . London:
          <string-name>
            <given-names>C.</given-names>
            <surname>Griffin</surname>
          </string-name>
          &amp; Company limited (
          <year>1946</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Faure</surname>
            ,
            <given-names>E.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shcherba</surname>
            ,
            <given-names>A.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rudnytskyi</surname>
            ,
            <given-names>V.M.:</given-names>
          </string-name>
          <article-title>The method and criterion for quality assessment of random number sequences</article-title>
          .
          <source>Cybernetics and Systems Analysis</source>
          ,
          <volume>52</volume>
          , no.
          <issue>2</issue>
          ,
          <fpage>277</fpage>
          -
          <lpage>284</lpage>
          (
          <year>2016</year>
          ).
          <source>doi: 10.1007/s10559-016-9824-3</source>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>