English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/2249
Share/Impact:
Statistics
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Title

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

AuthorsCaballero Gil, Pino; Fúster Sabater, Amparo
KeywordsSucesiones numéricas
Función aleatoria
Criptografía
Análisis lineal
Complejidad de problemas
Predicción estadística
Issue Date1998
PublisherUniversidad Complutense de Madrid
CitationRevista Matemática Complutense, 1998, 11 (1): 95-111.
AbstractPseudorandom 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.
URIhttp://hdl.handle.net/10261/2249
ISSN1139-1138
Appears in Collections:(IFA) Artículos
Files in This Item:
File Description SizeFormat 
Secuencias.pdf2,59 MBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.