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

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/10261/2249

Full metadata record

DC Field	Value	Language
dc.creator	Caballero Gil, Pino	-
dc.creator	Fúster Sabater, Amparo	-
dc.date	2007-11-20T13:31:11Z	-
dc.date	2007-11-20T13:31:11Z	-
dc.date	1998	-
dc.date.accessioned	2017-01-31T00:58:51Z	-
dc.date.available	2017-01-31T00:58:51Z	-
dc.identifier	Revista Matemática Complutense, 1998, 11 (1): 95-111.	-
dc.identifier	1139-1138	-
dc.identifier	http://hdl.handle.net/10261/2249	-
dc.identifier.uri	http://dspace.mediu.edu.my:8181/xmlui/handle/10261/2249	-
dc.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.	-
dc.description	Peer reviewed	-
dc.language	spa	-
dc.publisher	Universidad Complutense de Madrid	-
dc.rights	openAccess	-
dc.subject	Sucesiones numéricas	-
dc.subject	Función aleatoria	-
dc.subject	Criptografía	-
dc.subject	Análisis lineal	-
dc.subject	Complejidad de problemas	-
dc.subject	Predicción estadística	-
dc.title	Estudio de algunas secuencias pseudoaleatorias de aplicación criptográfica	-
dc.type	Artículo	-
Appears in Collections:	Digital Csic

Files in This Item:

There are no files associated with this item.

DSpace JSPUI