Geodesic
Random number generators: algorithms, testing, applications
Mathematica Applicanda, Tome 29 (2001) no. 43/02, pp. 32-66.

Voir la notice de l'article provenant de la source Annales Societatis Mathematicae Polonae Series

As usual in this journal, the present article is a survey paper which shows Polish readers the state-of-the-art today with the goal of stimulating them to new applications. In the paper, all essential developments in random number generation are treated and the working field of the author, cryptography, is especially mentioned. (In this field, the author has already published with others a major study [K. Górski et al., Generatory losowych ciągów binarnych w kryptografii, Warsaw, 1999; per bibl.].) Among the 70 references to the literature, naturally there are many Polish ones, which is useful for the Polish reader. After two introductory chapters on the application of random numbers and their history, in Chapter 3 the author deals with all known random number generators for uniform and arbitrary distributions, briefly also for stochastic processes. Chapter 4 is especially dedicated to the generation of random bit sequences (number-theoretic methods, shift registers, newer methods), which are of great importance in coding theory and cryptography. Ergodic and chaos theory are referred to. Finally, in Chapter 5 tests of random numbers are treated: traditional and modern ones (spectral, entropy, wavelet tests and such which are named cryptographic). The author recomends that the reader, from the immense number of tests, select a few efficient ones.
DOI : 10.14708/ma.v29i43/02.1890
Classification : 65C10 (14G50, 94A60)
Mots-clés : Random number generation, Applications to coding theory and cryptography, Cryptography 
@article{10_14708_ma_v29i43_02_1890,
     author = {Zbigniew Kotulski},
     title = {Random number generators: algorithms, testing, applications},
     journal = {Mathematica Applicanda},
     pages = { 32--66},
     publisher = {mathdoc},
     volume = {29},
     number = {43/02},
     year = {2001},
     doi = {10.14708/ma.v29i43/02.1890},
     language = {pl},
     url = {http://geodesic.mathdoc.fr/articles/10.14708/ma.v29i43/02.1890/}
}
TY  - JOUR
AU  - Zbigniew Kotulski
TI  - Random number generators: algorithms, testing, applications
JO  - Mathematica Applicanda
PY  - 2001
SP  -  32
EP  - 66
VL  - 29
IS  - 43/02
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.14708/ma.v29i43/02.1890/
DO  - 10.14708/ma.v29i43/02.1890
LA  - pl
ID  - 10_14708_ma_v29i43_02_1890
ER  - 
%0 Journal Article
%A Zbigniew Kotulski
%T Random number generators: algorithms, testing, applications
%J Mathematica Applicanda
%D 2001
%P  32-66
%V 29
%N 43/02
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.14708/ma.v29i43/02.1890/
%R 10.14708/ma.v29i43/02.1890
%G pl
%F 10_14708_ma_v29i43_02_1890
Zbigniew Kotulski. Random number generators: algorithms, testing, applications. Mathematica Applicanda, Tome 29 (2001) no. 43/02, pp.  32-66. doi : 10.14708/ma.v29i43/02.1890. http://geodesic.mathdoc.fr/articles/10.14708/ma.v29i43/02.1890/

Cité par Sources :