“Book Stack” as a New Statistical Test for Random Numbers

Ryabko, Boris; Pestunov, A. I.

doi:10.1023/b:prit.0000024881.86267.b5

Cited by 10 publications

(7 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, the US National Institute of Standards and Technology (NIST) has recently analyzed known test for the randomness hypothesis testing and recommended 16 methods for practical application in cryptography (see [11]). In [12] it is shown that the tests described in [13,14] surpass the methods from [11], which was also justified by our preliminary estimates for RC5. Therefore, for our analysis, we used the "book stack" and "adaptive χ 2 " tests from [13,14], respectively.…”

Section: Experiments With Rc5supporting

confidence: 58%

“…In [12] it is shown that the tests described in [13,14] surpass the methods from [11], which was also justified by our preliminary estimates for RC5. Therefore, for our analysis, we used the "book stack" and "adaptive χ 2 " tests from [13,14], respectively. It was found that the strength of the "book stack" test is on the average higher than that of the adaptive χ 2 test, whereas the latter has a much higher rate and is more convenient to realize on a multiprocessor computer.…”

Section: Experiments With Rc5supporting

confidence: 58%

See 1 more Smart Citation

A New Type of Attacks on Block Ciphers

2005

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Experiments With Rc5supporting

confidence: 58%

Section: Experiments With Rc5supporting

confidence: 58%

A New Type of Attacks on Block Ciphers

2005

Self Cite

View full text Add to dashboard Cite

show abstract

“…The book stack (also known as "move to front") test [28,29] is based on the fact that compressibility is a symptom of less randomness.…”

Section: A Book Stack Randomness Testmentioning

confidence: 99%

Experimental evidence of quantum randomness incomputability

Calude¹,

Dinneen²,

Dumitrescu³

et al. 2010

Phys. Rev. A

View full text Add to dashboard Cite

show abstract

“…The third test uses the "book stack" (also known as "move to front") randomness test as proposed in Ref. [141,142]. More compression is a symptom of less randomness.…”

Section: Tests Based On Algorithmic Information Theorymentioning

confidence: 99%

How Random Is Quantum Randomness? An Experimental Approach

Calude,

Dinneen,

Dumitrescu

et al. 2009

Preprint

View full text Add to dashboard Cite

Our aim is to experimentally study the possibility of distinguishing between quantum sources of randomness-recently proved to be theoretically incomputable-and some well-known computable sources of pseudo-randomness. Incomputability is a necessary, but not sufficient "symptom" of "true randomness."We base our experimental approach on algorithmic information theory which provides characterizations of algorithmic random sequences in terms of the degrees of incompressibility of their finite prefixes. Algorithmic random sequences are incomputable, but the converse implication is false. We have performed tests of randomness on pseudo-random strings (finite sequences) of length 2 32 generated with software (Mathematica, Maple), which are cyclic (so, strongly computable), the bits of π, which is computable, but not cyclic, and strings produced by quantum measurements (with the commercial device Quantis and by the Vienna IQOQI group). Our empirical tests indicate quantitative differences, some statistically significant, between computable and incomputable sources of "randomness."

show abstract

“Book Stack” as a New Statistical Test for Random Numbers

Cited by 10 publications

References 6 publications

A New Type of Attacks on Block Ciphers

A New Type of Attacks on Block Ciphers

Experimental evidence of quantum randomness incomputability

How Random Is Quantum Randomness? An Experimental Approach

Contact Info

Product

Resources

About