Results 1  10
of
12
A Survey on Cellular Automata
, 2003
"... A cellular automaton is a decentralized computing model providing an excellent platform for performing complex computation with the help of only local information. Researchers, scientists and practitioners from different fields have exploited the CA paradigm of local information, decentralized contr ..."
Abstract

Cited by 37 (0 self)
 Add to MetaCart
(Show Context)
A cellular automaton is a decentralized computing model providing an excellent platform for performing complex computation with the help of only local information. Researchers, scientists and practitioners from different fields have exploited the CA paradigm of local information, decentralized control and universal computation for modeling different applications. This article provides a survey of available literature of some of the methodologies employed by researchers to utilize cellular automata for modeling purposes. The survey introduces the different types of cellular automata being used for modeling and the analytical methods used to predict its global behavior from its local configurations. It further gives a detailed sketch of the efforts undertaken to configure the local settings of CA from a given global situation; the problem which has been traditionally termed as the inverse problem. Finally, it presents the different fields in which CA have been applied. The extensive bibliography provided with the article will be of help to the new entrant as well as researchers working in this field.
A cellular automaton based fast oneway hash function suitable for hardware implementation
 In Public Key Cryptography, number 1431 in Lecture Notes in Computer Science
, 1998
"... Abstract. Oneway hash functions are an important toolinachieving authentication and data integrity. The aim of this paper is to propose anovel oneway hash function based on cellular automata whose cryptographic properties have been extensivelystudiedover the past decade or so. Furthermore, securit ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
Abstract. Oneway hash functions are an important toolinachieving authentication and data integrity. The aim of this paper is to propose anovel oneway hash function based on cellular automata whose cryptographic properties have been extensivelystudiedover the past decade or so. Furthermore, security of the proposed oneway hash function is analyzed by the use of very recently published results on applications of cellular automata in cryptography. The analysis indicates that the oneway hash function is secure against all known attacks. An important feature of the proposed oneway hash function is that it is especially suitable for compact and fast implementation in hardware, which is particularly attractive to emerging security applications that employ smart cards, such asdigital identi cation cards and electronic cash payment protocols, 1
Encoded Dynamics for Fault Tolerance in Linear FiniteState Machines
 IEEE Transactions on Automatic Control
, 2002
"... Modular redundancy, the traditional approach to fault tolerance, is prohibitively expensive because of the overhead in replicating the hardware. In this paper we discuss fault tolerance in linear finitestate machines (LFSM's) and present a range of alternatives to modular redundancy. Our appro ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
Modular redundancy, the traditional approach to fault tolerance, is prohibitively expensive because of the overhead in replicating the hardware. In this paper we discuss fault tolerance in linear finitestate machines (LFSM's) and present a range of alternatives to modular redundancy. Our approach replaces a given LFSM with a larger, redundant one that preserves the state, evolution and properties of the original LFSM, perhaps in some linearly encoded form. The encoded state of the larger LFSM allows an external mechanism to perform error detection and correction by identifying and analyzing violations of the code restrictions. For a given LFSM and a given linear coding scheme, we completely characterize the class of appropriate redundant machines and illustrate how error detection and correction can be performed using techniques already developed in the communications setting. The existence of the class of redundant machines is a possibility that was not considered in previous work; we illustrate the consequences and applications of our approach through examples.
The Concatenation and Partitioning of Linear Finite State Machines
 Int. J. Electron
, 1995
"... This paper discusses the behaviour of linear finite state machines when partitioned into a number of smaller machines or concatenated into longer ones. We examine linear feedback shift registers (LFSRs) and linear cellular automata registers (LCARs) used in builtin selftest, cryptography and codin ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
This paper discusses the behaviour of linear finite state machines when partitioned into a number of smaller machines or concatenated into longer ones. We examine linear feedback shift registers (LFSRs) and linear cellular automata registers (LCARs) used in builtin selftest, cryptography and coding theory. We examine the concatenating and/or partitioning of machines which have a maximal length cycle structure to obtain longer or smaller ones maintaining this property. We show that LCARs have better overall behaviour than LFSRs. We introduce some minimum onecell modifications which improve the number of concatenated or partitioned machines and maintain a maximal length cycle. The hardware cost is discussed.
A Family of Fast Dedicated OneWay Hash Functions Based on Linear Cellular Automata over GF(q)
, 1999
"... This paper proposes a novel oneway hash function that can serve as a tool in achieving authenticity and data integrity. The oneway hash function can be viewed as a representative of a family of fast dedicated oneway hash functions whose construction is based on linear cellular automata over GF(q) ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper proposes a novel oneway hash function that can serve as a tool in achieving authenticity and data integrity. The oneway hash function can be viewed as a representative of a family of fast dedicated oneway hash functions whose construction is based on linear cellular automata over GF(q). The design and analysis of security of the function is accomplished by the use of very recently published results on cellular automata and their applications in cryptography. The analysis indicates that the oneway hash function is secure against all known attacks. A promising property of the proposed oneway hash function is that it is especially suitable for compact and fast implementation.
A Fast Cryptographic Hash Function Based on Linear Cellular Automata over GF(q)
"... Oneway hash functions are an important tool in achieving authentication and data integrity. The aim of this paper is to propose a novel oneway hash function based on linear cellular automata over GF(q). Design and security analysis of the proposed oneway hash function are based on the use of very ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Oneway hash functions are an important tool in achieving authentication and data integrity. The aim of this paper is to propose a novel oneway hash function based on linear cellular automata over GF(q). Design and security analysis of the proposed oneway hash function are based on the use of very recently published results on cellular automata and its applications in cryptography. The analysis indicates that the oneway hash function is secure against all known attacks. An important feature of the proposed oneway hash function is that it is especially suitable for compact and fast implementation.
Compositional Experimental Analysis of Cellular Automata: Attraction Properties and Logic Disjunction
, 1996
"... In this paper, we analyze attraction properties of elementary (i.e. Boolean, onedimensional, biinfinite) cellular automata (for short, CA). To overcome the wellknown undecidability constraints met by these systems, in addition to the classical extensive use of computer simulations, we introduc ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper, we analyze attraction properties of elementary (i.e. Boolean, onedimensional, biinfinite) cellular automata (for short, CA). To overcome the wellknown undecidability constraints met by these systems, in addition to the classical extensive use of computer simulations, we introduce composition: we first characterize basis CA, which we then use as building blocks to understand a whole family of CAbased systems obtained by composing them using logic disjunction. The compositional approach allows deep structured investigations, and it permits to define a new notion of dynamical complexity. 1 Experimental analysis of cellular automata Cellular automata. Cellular automata (for short, CA) are massively parallel systems obtained by composition of myriads of simple agents interacting locally, i.e. with their closest neighbors. In spite of their simplicity, the dynamics of CA is potentially very rich, and ranges from attracting stable configurations to spatiotemporal ...
Using Linear Hybrid Cellular Automata to Attack the Shrinking Generator ∗
"... SUMMARY The aim of this research is the efficient cryptanalysis of the Shrinking Generator through its characterization by means of Linear Hybrid Cellular Automata. This paper describes a new knownplaintext attack based on the computation of the characteristic polynomials of subautomata and on the ..."
Abstract
 Add to MetaCart
(Show Context)
SUMMARY The aim of this research is the efficient cryptanalysis of the Shrinking Generator through its characterization by means of Linear Hybrid Cellular Automata. This paper describes a new knownplaintext attack based on the computation of the characteristic polynomials of subautomata and on the generation of the Galois field associated to one of the Linear Feedback Shift Registers components of the generator. The proposed algorithm allows predicting with absolute certainty, many unseen bits of the keystream sequence, thanks to the knowledge of both registers lengths, the characteristic polynomial of one of the registers, and the interception of a variable number of keystream bits. key words: cellular automata, cryptanalysis, stream cipher, shrinking generator, algorithms, discrete mathematics 1.
A FAST AND SECURE STREAM CIPHER BASED ON CELLULAR AUTOMATA OVER GF(q)
"... The problem of designing a family of pseudorandom number generators for cryptographic applications, called key stream generators, is considered for wordoriented CPU platforms. A novel key stream generator, together with a new application of linear cellular automata over GF(q), is proposed. Construc ..."
Abstract
 Add to MetaCart
(Show Context)
The problem of designing a family of pseudorandom number generators for cryptographic applications, called key stream generators, is considered for wordoriented CPU platforms. A novel key stream generator, together with a new application of linear cellular automata over GF(q), is proposed. Construction of the generator is based on the use of very recently published results on cellular automata theory and its applications in cryptography, as well as on core principles employed in a number of existing key stream generators. Analysis indicates that the proposed generator satis es standard minimal security requirements including a large period and good statistical properties, and that it is secure against all known attacks. An important feature of the proposed generator is that it is compact and suitable for high speed applications. 1