A bound for the discrepancy of digital nets and its application to the analysis of certain pseudo-random number generators
Page 1 Next
Gerhard Larcher (1998)
Acta Arithmetica
J. Eichenauer, H. Grothe, J. Lehn (1987)
Manuscripta mathematica
Jaroslav Král (1972)
Kybernetika
Leonhard Bittner (1991)
Numerische Mathematik
H. Grothe, J. Hermann-Eichenauer (1989/1990)
Numerische Mathematik
Dorin Bocu (2000)
The Yugoslav Journal of Operations Research
U. DIETER, J. AHRENS (1971)
Numerische Mathematik
Jürgen Eichenauer-Herrmann, Harald Niederreiter (1995)
Acta Arithmetica
Harald NIEDERREITER (1982/1983)
Seminaire de Théorie des Nombres de Bordeaux
Tarsitano, Agostino (2010)
Journal of Probability and Statistics
J. Eichenauer-Herrmann (1994)
Monatshefte für Mathematik
Jiří Anděl (1983)
Acta Universitatis Carolinae. Mathematica et Physica
Edwin El-Mahassini (2008)
Revista Matemática Complutense
Peter Hellekalek, Hannes Leeb (1997)
Acta Arithmetica
J. Eichenauer, J. Lehn (1984)
Elemente der Mathematik
Jürgen Eichenauer-Herrmann (1996)
Metrika
Jürgen Eichenauer-Herrmann (1993)
Metrika
P. Caballero Gil, A. Fúster Sabater (1998)
Revista Matemática Complutense
Pseudorandom binary sequences are required in stream ciphers and other applications of modern communication systems. In the first case it is essential that the sequences be unpredictable. The linear complexity of a sequence is the amount of it required to define the remainder. This work addresses the problem of the analysis and computation of the linear complexity of certain pseudorandom binary sequences. Finally we conclude some characteristics of the nonlinear function that produces the sequences...
Harald Niederreiter (1978/1979)
Monatshefte für Mathematik
Jaroslav Král (1971)
Aplikace matematiky
Page 1 Next