Randomness Evaluation and Hardware Implementation of Nonadditive CA-Based Stream Cipher (original) (raw)
Optical Review, 1998
Pseudo-random properties of a class of two-dimensional (2-D) 5-neighborhood cellular automata (CA), built around nonlinear (OR, AND) and linear (XOR) Boolean functions are studied. The site values at each step of the 2-D CA evolution are taken in parallel and form pseudo-random sequences, which satisfy the criteria established L0r pseudo random number generator (PRNG): Iong period, excellent random qualities, single bit error propagation (avalanche criteria), easy and fast generation of the random bits. A block-scheme for secure Stream Cipher based on 2-D CA is proposed. The 2-D CA based PRNG algorithm has simple structure, use space-invariant and local interconnections and can be easily realized in very large scale integration or parallel optoelectronic architectures.
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 ...
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.
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.
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.
2015
This paper yields a (computational) security analysis for a generic class of randomized stream ciphers based on joint employment of encryption, error-correction coding, and dedicated random coding. We show that the security of these ciphers can be considerably less than their designers claim. In contrast to the approach for security evaluation used before, our technique is significantly simpler and allows us to find out the code-theoretic sense of parameters that determine the security of these ciphers. We also propose another possible solution (based on nonlinear random coding) for design of randomized stream ciphers with enhanced security.
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.
CASC 3N vs. 4N: Effect of Increasing Cellular Automata Neighborhood Size on Cryptographic Strength
International Journal of Advanced Computer Science and Applications, 2020
Stream ciphers are symmetric cryptosystems that rely on pseudorandom number generators (PRNGs) as a primary building block to generate a keystream. Stream ciphers have been extensively studied and many designs were proposed throughout the years. One of the popular designs used is the combination of linear feedback shift registers (LFSRs) and nonlinear feedback shift registers (NFSRs). Although this design is suitable for both software and hardware implementation and provides a good randomness behavior, it is still subject to attacks such as fault attacks and correlations attacks. Cellular automata (CAs) based stream ciphers are another design class that has been proposed. CAs display good cryptographic properties as well as a good randomness behavior, also high computational speed and a higher level of security. The use of CAs as cryptographic primitives is not recent and has been thoroughly investigated, especially the use of three-neighborhood onedimensional cellular automata. In this article, the authors investigate the impact of increasing the neighborhood size of CAs on the security level and the cryptographic properties provided. Thereafter, four-neighborhood one-dimensional CAs are studied and a stream cipher algorithm is proposed. The security of the proposed algorithm is demonstrated by using the results of standard tests (i.e. NIST Test Suite and Dieharder Battery of Tests), particularly by computing the cryptographic properties of the used CAs and by showing the resistance of the suggested algorithm to mostly known attacks.