Estudio de algunas secuencias pseudoaleatorias de aplicación criptográfica

  1. Fúster Sabater, Amparo
  2. Caballero Gil, Pino
Revue:
Revista matemática complutense

ISSN: 1139-1138 1988-2807

Année de publication: 1998

Volumen: 11

Número: 1

Pages: 95-111

Type: Article

DOI: 10.5209/REV_REMA.1998.V11.N1.17307 DIALNET GOOGLE SCHOLAR lock_openAccès ouvert editor

D'autres publications dans: Revista matemática complutense

Résumé

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.