Two-Dimensional Cellular Automata for Pseudo-Random Pattern Generators and for Highly Secure Stream Ciphers (original) (raw)

Stream cipher using two dimensional Cellular Automata

The pseudo-random early in cryptography systems, the important of cellular automata has properties which are considered a state machine, high periods. two–dimensional cellular automata was used to avoid the limitation of the generated periods in the pseudo-random binary sequences such that used in linear shift Feedback registers (LFSR) , the binary sequences that are generated form CA generator are characterized by their success in random tests.

Introduction of Cellular Automata in designing Stream Cipher

Pseudo-random number generators (PRNGs) are the main key component of stream ciphers used for encryption purposes. The proposed stream cipher design based upon a recent published design known as A2U2. Where linear feedback shift registers (LFSRs) combined with nonlinear feedback shift registers (NFSRs) have typically been used for PRNGs, the use of cellular automata (CA) is another viable option. A CA-based architecture will likely form the basis for the development of ultra-high speed and compact quantum-based computers. This paper explores the combination of LFSRs and CA as the key components of an efficient stream cipher design which can be implemented on Field Programmable Gate Arrays (FPGAs). The quality of random numbers from the proposed CA-based stream cipher is tested by using the DIEHARD test and entropy test. A2U2 stream cipher and the proposed CA based stream cipher is compared which explores the quality of random number generated and hence increases the security of the cipher.

2D- Cellular Automata Linear Rules for Cryptography Based on Pattern Evolution

ISR Journals, 2014

In the fast growing information and communication technology (ICT) challenge of data security is emerging out predominantly due to flow of vital data on the wired and wireless networks. Cryptosystems have been designed with various techniques of text encryption and decryption. Easy key encryptions have low level of attack immunity while as complex keys although more resistant to attacks have other drawbacks of occupying more memory space and low speed of encoding and decoding. Cryptosystems have been designed with the help of pseudo sequence generation property of cellular automata too and found relevant due to easy VLSI implementation. We have observed a large number of 2 - dimensional cellular automata linear rules in odd groups having an ability to generate the original data in the forward iterations of applied rule. This property is having a versatile fitness for cryptographic applications. Since almost all additive CA linear rules have been found to have irreversible character both encryption and decryption of data are possible in forward direction with the difference of iterations only. The model we can call as Pattern Cryptography, like other CA based models provides easy VLSI implementation with elegant properties of compact size, high efficiency and high speed at low cost. Since all odd groups contain such rules to achieve the cryptographic objectives, although with varied complexity, an additional feature of varied complexity can be incorporated in its VLSI design implementation.

On the design of stream ciphers with Cellular Automata having radius = 2

IACR Cryptol. ePrint Arch., 2020

Cellular Automata (CA) have recently evolved as a good cryptographic primitive. It plays an important role in the construction of new fast, efficient and secure stream ciphers. Several studies have been made on CA based stream ciphers and we observe that the cryptographic strength of a CA based stream cipher increases with the increase in the neighbourhood radii if appropriate CA rules are employed. The current work explores the cryptographic feasibility of 5-neighbourhood CA rules also referred to as pentavalent rules. A new CA based stream cipher, CARPenter, which uses pentavalent rules have been proposed. The cipher incorporates maximum length null-boundary linear CA and a non-linear CA along with a good non-linear mixing function. This is implemented in hardware as well as software and exhibits good cryptographic properties which makes the cipher resistant to almost all attacks on stream ciphers, but with the cost of additional computing requirements. This cipher uses 16 cycles ...

CARPenter: A Cellular Automata Based Resilient Pentavalent Stream Cipher

2018

Cellular Automata (CA) are a self reproducing model widely accepted for their applications in pattern recognition, VLSI design, error correcting codes, cryptography etc. They have also been widely accepted as good random number generators. The pseudorandom properties of 3- and 4-neighbourhood CA have been studied and they show that the neighbourhood radii has an impact on pseudorandomness. This motivated us to perform the exploration of 5-neighbourhood 1-dimensional CA for better cryptographic properties. We construct a class of linear and nonlinear rules for 5-neighbourhood CA and also propose a new stream cipher design using 5-neighbourhood CA inspired from the Grain cipher.

2 Dimensional Cellular Automata Based Design of Private Key Encryption Algorithm

International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, 2014

This paper presents the design of a Private key Algorithm based on 2-Dimensional Cellular Automata. Initial implementation of the Stream cipher is done using matlab tool to analyze its functionality and security. Advancement in computing technology applications like mobile communication, PDAs, navigational devices are at present being a part of everyone life. But these devices are restricted in computational power consumption, memory storage and data rate. Needs Security services like Confidentiality, Data integrity, and Authentication.

Theory and applications of cellular automata in cryptography

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.

Comparison between 2D cellular automata based pseudorandom number generators

IEICE Electronics Express, 2012

Pseudorandom number generators (PRNGs) should satisfy two main criteria, high randomness quality and fast computation of a sequence of numbers. In this paper, a comparative study of twodimensional Cellular Automata (CA) based PRNGs is performed to evaluate the randomness quality and the hardware constraints involved in terms of configuration parameters such as, transition rules, neighborhoods and bit extraction schemes. Experimental results show that CA-based PRNGs present good randomness quality using standard test suites, and they are well suited for parallel implementations in Field Programmable Gate Array (FPGA) technology taking advantage of the on-chip fine-grain and distributed computational resources.

Improvement and Analysis of a Pseudo-Random Bit Generator by Means of Cellular Automata

International Journal of Modern Physics C, 2010

In this paper, we implement a revised pseudo random bit generator based on a rule-90 cellular automaton. For this purpose, we introduce a sequence matrix H N with the aim of calculating the pseudo random sequences of N bits employing the algorithm related to the automaton backward evolution. In addition, a multifractal structure of the matrix H N is revealed and quantified according to the multifractal formalism. The latter analysis could help to disentangle what kind of automaton rule is used in the randomization process and therefore it could be useful in cryptanalysis. Moreover, the conditions are found under which this pseudo random generator passes all the statistical tests provided by the National Institute of Standards and Technology (NIST).