Design of Balanced Binary Sequences for Cryptographic Applications

García-Mochales, Pedro; Fúster Sabater, Amparo; Guía Martínez, Dolores de la

Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/8846

COMPARTIR / EXPORTAR:

SHARE BASE	Comparte tu historia de Acceso Abierto
Visualizar otros formatos: MARC \| Dublin Core \| RDF \| ORE \| MODS \| METS \| DIDL \| DATACITE
Refman EndNote Bibtex RefWorks Excel CSV PDF DataCite Send via email

Título:	Design of Balanced Binary Sequences for Cryptographic Applications
Autor:	García-Mochales, Pedro CSIC; Fúster Sabater, Amparo CSIC ORCID; Guía Martínez, Dolores de la
Palabras clave:	Pseudorandom sequences Balancedness Binary strings LFSR-based generators
Fecha de publicación:	jul-2001
Editor:	International Institute of Informatics and Systemics Institute of Electrical and Electronics Engineers
Citación:	5th World Multiconference on Systemics, Cybernetics and Informatics and 7th International Conference on Information System Analysis and Synthesis (SCI/ISAS 2001) ; IS0051303
Resumen:	An easy method of computing the number of 1's in the binary sequences obtained from either non-linear filter generators or combination generators is developed. The procedure is based exclusively on the handling of binary strings by means of logic operatots (OR, AND) and can be applied to nonlinear generators in a range of cryptographic interest. As a straight consequence of this method, simple rules to design generators producing balanced (quasi-balanced) systems are also derived.
Descripción:	5 pages, 2 tables.-- Communication presented at the 5th World Multiconference on Systemics, Cybernetics and Informatics and 7th International Conference on Information System Analysis and Synthesis (SCI/ISAS 2001, Orlando, Florida, Jul 22-25, 2001).
URI:	http://hdl.handle.net/10261/8846
ISBN:	980-07-7529-3
Aparece en las colecciones:	(IFA) Comunicaciones congresos (SGAI) Comunicaciones congresos (IMN-CNM) Comunicaciones congresos