Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/10261/2249| Title: | Estudio de algunas secuencias pseudoaleatorias de aplicación criptográfica |
| Keywords: | Sucesiones numéricas Función aleatoria Criptografía Análisis lineal Complejidad de problemas Predicción estadística |
| Publisher: | Universidad Complutense de Madrid |
| Description: | 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. Peer reviewed |
| URI: | http://dspace.mediu.edu.my:8181/xmlui/handle/10261/2249 |
| Other Identifiers: | Revista Matemática Complutense, 1998, 11 (1): 95-111. 1139-1138 http://hdl.handle.net/10261/2249 |
| Appears in Collections: | Digital Csic |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.