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


Solving Linear Difference Equations by Means of Cellular Automata

AuthorsFúster Sabater, Amparo; Caballero Gil, Pino; Delgado, Óscar
KeywordsCellular automata operations
Cryptographic sequences
CA-based models
Issue Date22-Dec-2007
CitationAdvances in Soft Computing 44: 183-190 (2007)
AbstractIn this work, it is shown that linear Cellular Automata based on rules 90/150 generate all the solutions of linear difference equations with binary constant coefficients. Some of these solutions are binary sequences with application in cryptography. In this sense, we propose CA-based linear models that realize the solutions of difference equations as well as behave as cryptographic keystream generators. Due to the simple transition rules that govern these CA, the implementation of such models is quite easy. Some illustrative examples complete the work.
Description8 pages.-- Book title: "Innovations in Hybrid Intelligent Systems", E. Corchado et al (Eds.).-- Copyright date 2008.
Publisher version (URL)http://dx.doi.org/10.1007/978-3-540-74972-1_25
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.