Life-Like Cellular Automata based Cryptographic Hash Function

Mathematics

The theory and application of cellular automata (CA) for a stream cipher-based encryption principle are presented in this study. Certain fundamental transformations are developed based on CA theory regarding decentralized computation for modeling different system’s behavior. The changes governing state transitions rely on simple evolution rules, which can easily be translated into functions using logic operators. A class of linear hybrid cellular automata (LHCA) based on rules 90 and 150 is used to implement these functions. Symmetric key systems theory is the foundation of the suggested algorithm. The algorithm functions use the proprieties provided by the LHCA evolution in order to convert plain text into cipher text and vice versa, in each case starting from the same initial state of the system and performing the same number of steps for each operation. Cellular automata’s parallel information processing property, in addition to their regular and dynamical structure, makes hardwa...

Lecture Notes in Computer Science, 1998

One-way hash functions are an important tool in achieving authentication and data integrity. The aim of this paper is to propose a novel one-way hash function based on cellular automata whose cryptographic properties have been extensively studied over the past decade or so. Furthermore, security of the proposed one-way hash function is analyzed by the use of very recently published results on applications of cellular automata in cryptography. The analysis indicates that the one-way hash function is secure against all known attacks. An important feature of the proposed one-way 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 as digital identification cards and electronic cash payment protocols,

International Journal of Computer Network and Information Security

Security and confidentiality are the major concerns in information technology enabled services wherein data security, user authentication, industrial security and message authentication have a great deal of access to the world anywhere, anytime. The implication is: there is a need for efficient methods to secure digital data across different platforms. The concept of cellular automata finds application in the design of efficient methods to secure digital information. It is a recent field of research and its recognition has been on the rise with its high parallel structure and ability to design complex dynamic systems. In this paper, we study the basic concepts of different types of cellular automata and also discuss its applications in cryptography with various examples.

New cryptographic hash functions based on cellular automaton have been proposed in the last years . Most of this algorithms are based on the well-known Merkle-Damgård construction . I investigated the possibility to use a complete different approach in order to generate new cryptographic hash functions with the use of simple cellular automaton in the spirit of NKS ("Simple rules can produce complex behavior" S.Wolfram). In order to prove the quality of the proposed cryptographic hash functions i used the standard Avalanche and Collision Tests [1,2].

International Journal of Computing

This paper deals with the development of two symmetric encryption algorithms on the basis of cellular automata: a block cipher, that is based on AES and uses three-dimensional cellular automata; a stream cipher, that exploits a hardware-software entropy generation (tracking of keystrokes and mouse pointer movement), as well as the developed hash function, based on “cryptographic sponge” architecture of SHA-3, modified by cellular automata transformations. The block cipher is designed in architecture of SP-network and uses the AES substitution block. Permutation layer and key generation is designed on the basis of cellular automata rules (rules “22”, “105” and “150”). The optimal number of rounds to achieve maximum crypto resistance is determined. The stream cipher is designed on the basis of hardware-software entropy generation and uses the cryptographic hash-function in the SHA-3 architecture. Permutation function is developed on the basis of cellular automata rules (rules “30” and...

Engineering Applications of Artificial Intelligence, 1997

A family of basis functions, generated from the evolving states of Cellular Automata (CA), is used to compress and encrypt data. The operations required in encoding and decoding the data are described under the umbrella Cellular Automata Transforms (CAT). There is a ...

IEEE Transactions on Computers, 1994

This paper deals with the theory and application of Cellular Automata (CAI for a class of block ciphers and stream ciphers. Based on CA state transitions certain fundamental transformations are defined which are block ciphering functions of the proposed enciphering scheme. These fundamental transformations are found to generate the simple (alternating) group of even permutations which in turn is a subgroup of the permutation group. These functions are implemented with a class of programmable cellular automata (PCA) built around rules 51, 153, and 195. Further, high quality pseudorandom pattern generators built around rule 90 and 150 programmable cellular automata with a rule selector (Le., combining function) has been proposed as running key generators in stream ciphers. Both the schemes provide better security against different types of attacks. With a simple, regular, modular and cascadable structure of CA, hardware implementation of such schemes idealy suit for VLSI implementation.

International Journal of Advanced Computer Science and Applications, 2019

Cryptographic hash functions (CHF) represent a core cryptographic primitive. They have application in digital signature and message authentication protocols. Their main building block are Boolean functions. Those functions provide pseudo-randomness and sensitivity to the input. They also help prevent and lower the risk of attacks targeted at CHF. Cellular automata (CA) are a class of Boolean functions that exhibit good cryptographic properties and display a chaotic behavior. In this article, a new hash function based on CA is proposed. A description of the algorithm and the security measures to increase the robustness of the construction are presented. A security analysis against generic and dedicated attacks is included. It shows that the hashing algorithm has good security features and meet the security requirements of a good hashing scheme. The results of the tests and the properties of the CA used demonstrate the good statistical and cryptographic properties of the hash function.

2012

As the technology is rapidly advancing day by day sharing of information over the internet is experiencing an explosive growth, which in turn is also posing new threats and vulnerabilities in the existing systems. The quest for more stronger and reliable methodologies to tackle the security issues is unending. In this direction a new cryptographic method is proposed in this paper based on Layered Cellular Automata (LRCA) and the strengths are analyzed in comparison with the existing systems. Index Terms – Cellular Automata (CA), Reversible Cellular Automata (RCA), Layered Cellular Automata, Symmetric key, Encryption. I.INTRODUCTION Over the past two decades Cryptographic techniques have become essential part of any secure digital communication. All the cryptosystems can be classified in two types Private key systems and Public key systems. In symmetric key system both the sender and receiver use the same key to reveal the information (also called as secret key encryption). In public...

International Journal of Electrical and Computer Engineering (IJECE), 2023

The cryptographic hash functions are the most fundamental cryptographic concept. These functions are used as basic building blocks for digital signatures and message authentication. Boolean functions are the core of hash functions. These functions are expected to provide pseudo-randomness as well as input sensitivity. Cellular automata are a form of Boolean function that exhibits strong cryptography properties as well as chaotic behavior. This paper proposes a hash function, designed on the principle of cellular automata. The proposed algorithm is secure and meets the requirements for a successful hashing scheme. The hash function has strong statistical and cryptographic characteristics, according to the findings of the avalanche test and the National Institute of Standards and Technology (NIST) Statistical Test Suite. The modularity of different operations of this algorithm makes it suitable for a high-capacity processing environment to produce efficient performance.

2004

In this paper, cellular automata (CAs) are used to design a symmetric key cryptography system based on Vernam cipher. CAs are applied to generate a pseudo-random numbers sequence (PNS) which is used during the encryption process. The quality of PNSs highly depends on the set of applied CA rules. Rules of radius r= 1 and 2 for nonuniform one-dimensional CAs have been considered. A new set of rules has been discovered using an evolutionary technique called cellular programming.

2003

Abstract The paper presents new results concerning application of cellular automata (CA) to secret key cryptography extending results presented in Tomassini and Perrenoud (2000), and Tomassini and Sipper (2000). One dimensional, nonuniform CA is considered as a generator of pseudorandom number sequences (PNS) used in cryptography with the secret key. The quality of PNS highly depends on a set of applied CA rules. To find such rules nonuniform CA with two types of rules is considered.

Soft Computing Research Society eBooks, 2022

In this digital world, images are an important part of communication and while communicating security is a crucial problem. And to deal with security various image encryption techniques are based on the cellular automata. The study gives a basic introduction to cryptography and cellular automata and various encryption scheme based on cellular automata. Various performance measures related to the analysis of encryption techniques have been studied. And a comparison of encryption techniques based on the performance matrices is presented. The paper gives a concluding remark on the advancement in the field of image encryption.

Journal of Network and Information Security, 2017

The Cellular Automata (CA) were invented in the late 1940 by Stanislaw Ulam and John Von Neumann. CA are simple models of computation in which the components act together and exhibit complex behavior. Initially CA are represented as model of self-reproducing organisms. Later they are applied in various areas like Physics, biology and other applications. The self-reproducing behavior is then utilized to construct Universal Turing Machine. This Survey is about the applications of CA closer to Computer Science especially designing Pseudo Random Number Generator.

2018

The topic of cellular automata has many interesting and wide ranging applications to real life problems emerging from areas such as image processing, cryptography, neural networks, developing electronic devices and modelling biological systems. In fact cellular automata can be a powerful tool for modelling many kinds of systems. In the March 2018 issue of At Right Angles we had introduced the basic ideas which form the foundation of the Elementary Cellular Automata (ECA) as defined by Stephen Wolfram. The reader is urged to go through the article before reading this. The topic of Cellular Automata lends itself to interesting investigations which are well within the reach of high school students. We had illustrated the simple and yet powerful ideas in the previous article where we had described and analysed the behaviour of the 256 ECAs. In this article we shall provide a brief recap for the first time reader before moving on to the concept of Totalistic Cellular Automata