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


Linear Cellular Automata as Discrete Models for Generating Cryptographic Sequences

AuthorsCaballero Gil, Pino; Fúster Sabater, Amparo; Delgado, Óscar
Stream Cipher
Cellular Automata
Difference Equation
Issue DateNov-2008
PublisherAustralian Computer Society
CitationJournal of Research and Practice in Information Technology (JRPIT) 40(4): 283-290 (2008)
AbstractIn this paper, we develop a new cellular automata-based linear model for several nonlinear pseudorandom number generators with practical applications in symmetric cryptography. Such a model generates all the solutions of linear binary difference equations as well as many of these solutions are pseudo-random keystream sequences. In this way, a linear structure based on cellular automata may be used to generate not only difference equation solutions but also cryptographic sequences. The proposed model is very simple since it is based exclusively on successive concatenations of a basic linear automaton.
Description8 pages, 2 tables.-- ACM Classification Codes: E.3 (Data Encryption), B.6.1 (Design Styles), F.1.1 (Models of Computation), G.2.1 (Combinatorics).-- Previous version of the paper presented at: Sixth Australasian Information Security Conference (AISC 2008, Wollongong, NSW, Australia), available at: http://digital.csic.es/handle/10261/11021
Publisher version (URL)http://www.jrpit.acs.org.au/jrpit/JRPITVolumes/JRPIT40/JRPIT40.4.255.pdf
Appears in Collections:(IFA) Artículos
Files in This Item:
File Description SizeFormat 
JRPIT40.4.255.pdf477,36 kBAdobe PDFThumbnail
Show full item record
Review this work

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