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 to guarantee a minimum linear complexity.
@article{urn:eudml:doc:44475,
title = {Estudio de algunas secuencias pseudoaleatorias de aplicaci\'on criptogr\'afica.},
journal = {Revista Matem\'atica de la Universidad Complutense de Madrid},
volume = {11},
year = {1998},
pages = {95-111},
zbl = {0909.94008},
language = {es},
url = {http://dml.mathdoc.fr/item/urn:eudml:doc:44475}
}
Caballero Gil, P.; Fúster Sabater, A. Estudio de algunas secuencias pseudoaleatorias de aplicación criptográfica.. Revista Matemática de la Universidad Complutense de Madrid, Tome 11 (1998) pp. 95-111. http://gdmltest.u-ga.fr/item/urn:eudml:doc:44475/