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


Cellular Automata-Based Structures to Compute the Solutions of Linear Difference Equations

AuthorsFúster Sabater, Amparo; Caballero Gil, Pino; Delgado, Óscar
KeywordsCellular automata
Natural computing
Difference equation
Issue Date24-Aug-2008
CitationLecture Notes in Computer Science 5191: 42-49 (2008)
AbstractA cellular automata-based linear model that computes all the solutions of linear binary difference equations has been developed. Such a model is based on successive concatenations of a basic linear automaton. Different sequential solutions are obtained from different automaton initial states. Many of these solutions are binary sequences of cryptographic utility. In this way, a linear structure based on cellular automata realizes not only difference equation solutions but also generates sequences currently used in cryptography. The model is simple, linear and can be applied in a range of practical cryptographic applications.
Description8 pages.-- Book title: "Cellular Automata" (Proc. 8th International Conference on Cellular Aotomata for Reseach and Industry, ACRI 2008, Yokohama, Japan, September 23-26, 2008), H. Umeo et al (Eds.).
Publisher version (URL)http://dx.doi.org/10.1007/978-3-540-79992-4_6
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.