Problemy Peredachi Informatsii
General information
Latest issue
Impact factor
Guidelines for authors

Search papers
Search references

Latest issue
Current issues
Archive issues
What is RSS

Probl. Peredachi Inf.:

Personal entry:
Save password
Forgotten password?

Probl. Peredachi Inf., 2004, Volume 40, Issue 1, Pages 73–78 (Mi ppi125)  

This article is cited in 9 scientific papers (total in 9 papers)

Methods of Signal Processing

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

B. Ya. Ryabko, A. I. Pestunov

Institute of Computing Technologies, Siberian Branch of the Russian Academy of Sciences

Abstract: A new statistical test is proposed for testing the hypothesis $H_0$ that symbols of an alphabet are generated with equal probabilities against the alternative hypothesis $H_i$, the negation of $H_0$. The new method is applied to testing generators of pseudorandom numbers. It is experimentally demonstrated that the method makes it possible to detect deviations from randomness for many generators which withstand previously known statistical tests.

Full text: PDF file (766 kB)
References: PDF file   HTML file

English version:
Problems of Information Transmission, 2004, 40:1, 66–71

Bibliographic databases:

UDC: 621.391.1:519.27
Received: 26.05.2003

Citation: B. Ya. Ryabko, A. I. Pestunov, ““Book Stack” as a New Statistical Test for Random Numbers”, Probl. Peredachi Inf., 40:1 (2004), 73–78; Problems Inform. Transmission, 40:1 (2004), 66–71

Citation in format AMSBIB
\by B.~Ya.~Ryabko, A.~I.~Pestunov
\paper ``Book Stack'' as a New Statistical Test for Random Numbers
\jour Probl. Peredachi Inf.
\yr 2004
\vol 40
\issue 1
\pages 73--78
\jour Problems Inform. Transmission
\yr 2004
\vol 40
\issue 1
\pages 66--71

Linking options:

    SHARE: FaceBook Twitter Livejournal

    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. B. Ya. Ryabko, V. A. Monarev, Yu. I. Shokin, “A New Type of Attacks on Block Ciphers”, Problems Inform. Transmission, 41:4 (2005), 385–394  mathnet  crossref  mathscinet  zmath
    2. Doroshenko S., Fionov A., Lubkin A., Monarev V., Ryabko B., Shokin Yu.I., “Experimental statistical attacks on block and stream ciphers”, Computational Science and High Performance Computing III, Notes on Numerical Fluid Mechanics and Multidisciplinary Design, 101, 2008, 155–164  crossref  mathscinet  isi
    3. Calude C.S., Dinneen M.J., Dumitrescu M., Svozil K., “Experimental evidence of quantum randomness incomputability”, Phys Rev A, 82:2 (2010), 022102  crossref  mathscinet  adsnasa  isi  elib
    4. D. N. Shevchenko, S. V. Krivenkov, “Metodika testirovaniya i ispolzovaniya generatorov psevdosluchainykh posledovatelnostei”, PFMT, 2014, no. 2(19), 89–95  mathnet
    5. A. I. Pestunov, “Predvaritelnaya otsenka minimalnogo chisla raundov legkovesnykh shifrov dlya obespecheniya ikh udovletvoritelnykh statisticheskikh svoistv”, PDM. Prilozhenie, 2015, no. 8, 66–68  mathnet  crossref
    6. A. V. Sokolov, O. N. Zhdanov, N. A. Barabanov, “Generator psevdosluchainykh klyuchevykh posledovatelnostei na osnove troistvennykh naborov bent-funktsii”, PFMT, 2016, no. 1(26), 85–91  mathnet
    7. O. V. Denisov, R. A. Bylina, “Matrichnaya formula dlya raspredeleniya vykhoda blochnoi skhemy shifrovaniya i statisticheskii kriterii na ee osnove”, PDM, 2016, no. 2(32), 33–48  mathnet  crossref
    8. Ryabko B., Soskov A., “Application of the Distinguishing Attack to Lightweight Block Ciphers”, 2017 International Multi-Conference on Engineering, Computer and Information Sciences (Sibircon), IEEE, 2017, 338–341  crossref  isi
    9. A. A. Perov, A. I. Pestunov, “O vozmozhnosti primeneniya svertochnykh neironnykh setei k postroeniyu universalnykh atak na iterativnye blochnye shifry”, PDM, 2020, no. 49, 46–56  mathnet  crossref
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:1453
    Full text:674
    First page:3

    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2021