We address the problem of testing the hypothesis H0 that the letters from some alphabet A = {a1, a2, . . . , ak}, are distributed uniformly (i.e. p(a1) = p(a2) = . . . = p(ak) = 1/k) against the alternative hypothesis H1 that the true distribution is not uniform, in case k is large. (It is typical for random number testing and some cryptographic problems where k = 210 ∼ 230 and more, see [2, 8,...