English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/11012
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 | DATACITE
Exportar a otros formatos:

Title

On the Use of Linear Cellular Automata for the Synthesis of Cryptographic Sequences

AuthorsFúster Sabater, Amparo; Caballero Gil, Pino; Delgado, Óscar
KeywordsInterleaved sequence
Linear cellular automata
Self-shrinking generator
Cryptography
Issue Date30-Sep-2008
PublisherSpringer
CitationAdvances in Soft Computing Series 5271: 24-26 (2008)
AbstractThis work shows that a class of cryptographic sequences, the so-called interleaved sequences, can be generated by means of linear hybrid cellular automata. More precisely, linear multiplicative polynomial cellular automata generate all the components of this family of interleaved sequences. As an illustrative example, the linearization procedure of the self-shrinking generator is described. In this way, popular nonlinear sequence generators with cryptographic application are linearized in terms of simple cellular automata.
Description8 pages.-- Book title: "Hybrid Artificial Intelligence Systems" (E. Corchado, A. Abraham and W. Pedrycz, Eds.): Proc. Third International Workshop, HAIS 2008, Burgos, Spain, Sep 24-26, 2008.
Publisher version (URL)http://dx.doi.org/10.1007/978-3-540-87656-4_59
URIhttp://hdl.handle.net/10261/11012
DOIhttp://dx.doi.org/10.1007/978-3-540-87656-4_59
ISBN978-3-540-87655-7
ISSN0302-9743
E-ISSN1611-3349
Appears in Collections:(IFA) Libros y partes de libros
Files in This Item:
There are no files associated with this item.
Show full item record
Review this work
 


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