Full paper in PDF:
$%P. Caballero Gil and A. Fúster Sabater, Estudio de algunas secuencias pseudoaleatorias de
aplicación criptográfica, Rev. Mat. Complut. 11 (1998), no. 1, 95–111.%$
Dpto. de Estadística, I. O. y C. Facultad de Matemáticas Universidad de La Laguna 38271 La Laguna (Tenerife) — Spain | Laboratorio de Criptográfia, CSIC Serrano 144 28006 Madrid — Spain |
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.
1991 Mathematics Subject Classification: 11K45, 94A55.