English   español  
Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/11007
Compartir / Impacto:
Estadísticas
Add this article to your Mendeley library MendeleyBASE
 |  Ver citas en Google académico
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Título

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

AutorFúster Sabater, Amparo; Caballero Gil, Pino; Delgado, Óscar
Palabras claveCellular automata
Natural computing
Difference equation
Cryptography
Fecha de publicación24-ago-2008
EditorSpringer
CitaciónLecture Notes in Computer Science 5191: 42-49 (2008)
ResumenA 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.
Descripción8 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.).
Versión del editorhttp://dx.doi.org/10.1007/978-3-540-79992-4_6
URIhttp://hdl.handle.net/10261/11007
DOI10.1007/978-3-540-79992-4_6
ISBN978-3-540-79991-7
ISSN0302-9743 (Print)
1611-3349 (Online)
Aparece en las colecciones: (IFA) Libros y partes de libros
Ficheros en este ítem:
No hay ficheros asociados a este ítem.
Mostrar el registro completo
 


NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.