Results 1  10
of
26
A Framework for the Design of OneWay Hash Functions Including Cryptanalysis of Damg˚ard’s OneWay Function Based on a Cellular Automaton
 Advances in cryptology  ASIACRYPT '91, Lecture Notes in Computer Science
, 1993
"... At Crypto ’89 Ivan Damg˚ard [1] presented a method that allows one to construct a computationally collision free hash function that has provably the same level of security as the computationally collision free function with input of constant length that it is based upon. He also gave three examples ..."
Abstract

Cited by 25 (2 self)
 Add to MetaCart
At Crypto ’89 Ivan Damg˚ard [1] presented a method that allows one to construct a computationally collision free hash function that has provably the same level of security as the computationally collision free function with input of constant length that it is based upon. He also gave three examples of collision free functions to use in this construction. For two of these examples collisions have been found[2] [3], and the third one is attacked in this paper. Furthermore it is argued that his construction and proof, in spite of their theoretical importance, encourage inefficient designs in the case of practical hash functions. A framework is presented for the direct design of collision free hash functions. Finally a concrete proposal is presented named Cellhash. 1
Cryptography with Dynamical Systems
 In: Cellular Automata and Cooperative Phenomena, Eds: E. Goles and N. Boccara
, 1993
"... Dynamical systems are often described as "unpredictable" or "complex " as aspects of their behavior may bear a cryptic relationship with the simple evolution laws which define them. Some theorists work to quantify this complexity in various ways. Others try to turn the cryptic na ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
Dynamical systems are often described as "unpredictable" or "complex " as aspects of their behavior may bear a cryptic relationship with the simple evolution laws which define them. Some theorists work to quantify this complexity in various ways. Others try to turn the cryptic nature of dynamical systems to a practical end: encryption of messages to preserve their secrecy. Here some previous efforts to engineer cryptosystems based on dynamical systems are reviewed, leading up to a detailed proposal for a cellular automaton cryptosystem. Cryptosystems constructed from cellular automaton primitives can be implemented in simply constructed massively parallel hardware. They can be counted on to deliver high encryption/decryption rates at low cost. In addition to these practical features, cellular automaton cryptosystems may help illuminate some foundational issues in both dynamical systems theory and cryptology, since each of these disciplines rests heavily on the meanings given to the int...
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 13 (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
The Topological Skeleton of Cellular Automaton Dynamics
, 1996
"... We have developed statistical techniques to study the structure the statetransition graphs of cellular automata with periodic boundary conditions, in the limit of large system size. We organize our results around the concept of a topological skeleton. The topological skeleton is the set of physical ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We have developed statistical techniques to study the structure the statetransition graphs of cellular automata with periodic boundary conditions, in the limit of large system size. We organize our results around the concept of a topological skeleton. The topological skeleton is the set of physically relevant states. Covering this skeleton is a surface, typically thin and dense, which contains the bulk of the set of states. States in the skeleton have some long histories. States on the surface, by contrast, have only short histories; they are reached only near the beginning of cellular automaton evolution. We study in detail a sequence of rules which exhibit mostly skeletal to mostly surface structure.
Reduced Complexity Attacks on the Alternating Step Generator
"... Abstract. In this paper, we present some reduced complexity attacks on the Alternating Step Generator (ASG). The attacks are based on a quite general framework and mostly benefit from the low sampling resistance of the ASG, and of an abnormal behavior related to the distribution of the initial state ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper, we present some reduced complexity attacks on the Alternating Step Generator (ASG). The attacks are based on a quite general framework and mostly benefit from the low sampling resistance of the ASG, and of an abnormal behavior related to the distribution of the initial states of the stop/go LFSR’s which produce a given segment of the output sequence. Our results compare well with previous results as they show a greater flexibility with regard to known output of the ASG, which amounts in reduced complexity. We will also give a closed form for the complexity of attacks on ASG (and SG) as presented in [13].
A Walsh exploration of elementary CA rules
 INTERNATIONAL WORKSHOP ON CELLULAR AUTOMATA, HIROSHIMA: JAPON
, 2006
"... In this paper, we explore the 256 elementary cellular automata rules by a Walsh transform in order to find out correlationimmune rules for generating good pseudorandom sequences. We prove that, except the 8 linear rules, there is no correlationimmune rule among the 256 rules. Thus, Wolfram cellul ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
In this paper, we explore the 256 elementary cellular automata rules by a Walsh transform in order to find out correlationimmune rules for generating good pseudorandom sequences. We prove that, except the 8 linear rules, there is no correlationimmune rule among the 256 rules. Thus, Wolfram cellular automata cannot be used as a cryptographic pseudorandom generator since the generated pseudorandom sequences are susceptible of correlation attacks. We conclude with some remarks on cryptography with cellular automata.
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
"... Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A simple computational model which captures this constraint is a cellular automaton: A discrete dynamical system in which c ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A simple computational model which captures this constraint is a cellular automaton: A discrete dynamical system in which cells are placed on a grid and the state of each cell is updated via a local deterministic rule that depends only on the few cells within its close neighborhood. Cellular automata are commonly used to model real world systems in nature and society. Cellular automata were shown to be capable of a highly complex behavior. However, it is not clear how fast this complexity can evolve and how common it is with respect to all possible initial configurations. We examine this question from a computational perspective, identifying “complexity ” with computational intractability. More concretely, we consider an ncell automaton with a random initial configuration, and study the minimal number of computation steps t = t(n) after which the following problems can become computationally hard: • The inversion problem. Given the configuration y at time t, find an initial configuration x which leads to y in t steps.
Cellular Automata and the Sciences of Complexity (part II)
 Complexity
, 1996
"... This is the final half of a review of selected problems in the theory of cellular automata. Contents 1 State Transition Graphs 3 2 Cryptography 9 3 Suggested Reading 17 1 State Transition Graphs In the first half of this article, we looked at the behavior of cellular automata on infinite lattice ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This is the final half of a review of selected problems in the theory of cellular automata. Contents 1 State Transition Graphs 3 2 Cryptography 9 3 Suggested Reading 17 1 State Transition Graphs In the first half of this article, we looked at the behavior of cellular automata on infinite lattices. In this final half we will examine some of the properties of CA acting on finite systems, and trace their relationships with properties of infinitesized systems. Consider a onedimensional cellular automaton operating on periodic lattices of cells each having two states. If the size of the periodic lattice is s, then there are 2 s possible configurations of cell states on the lattice. Each configuration maps to a new configuration under the action of the cellular automaton rule. Thus, we think of the configuration as a node in a graph, with an outgoing arc leading to its successor configuration. As the number of possible configurations is finite, any initial configuration must map ...
Nonuniform cellular automata for cryptography
 Complex Systems
, 2000
"... Cryptography is a basic requirement in today’s distributed information storage and transmission systems. A single key cryptographic system based on cellular automata is described. The approach employs highquality pseudorandom bit sequences produced by one and twodimensional nonuniform cellular a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Cryptography is a basic requirement in today’s distributed information storage and transmission systems. A single key cryptographic system based on cellular automata is described. The approach employs highquality pseudorandom bit sequences produced by one and twodimensional nonuniform cellular automata. The robustness of the scheme against cryptanalytic attacks is discussed and it is shown that direct cryptanalysis requires an exponential amount of computational resources. A further advantage of the proposed scheme is that it is eminently suitable for hardware implementation. 1.