Randomness Evaluation and Hardware Implementation of Nonadditive CA-Based Stream Cipher (original) (raw)
Related papers
IJERT-Design and Implementation of a Secure Stream Cipher for Cryptographic Applications
International Journal of Engineering Research and Technology (IJERT), 2015
https://www.ijert.org/design-and-implementation-of-a-secure-stream-cipher-for-cryptographic-applications https://www.ijert.org/research/design-and-implementation-of-a-secure-stream-cipher-for-cryptographic-applications-IJERTV4IS070422.pdf Stream ciphers based on hash functions are less complex in hardware and provides better security in embedded systems having space constraints. The commonly used Linear Feedback Shift Register (LFSR) structures with inherent linearity can be used along with hash function based Pseudo Random Number Generator (PRNG) structures to increase periodicity and throughput. In such cases the security of the PRNG depends on the hash function used and the way in which it is used. In this paper, the Cyclic Redundancy Check (CRC) hash circuit is combined with the normal LFSR circuit and the keystream is generated by the CRC circuit. The proposed design is implemented for 8 bit, 16 bit and 128 bit key sizes in FPGA platform. The design possess good security and periodicity for the keystream generated. The proposed method is validated in terms of randomness using the statistical test suite provided by National Institute of Standards and Technology (NIST).
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.
IJERT-Design of a Lightweight Stream Cipher: BOKHARI 256
International Journal of Engineering Research and Technology (IJERT), 2020
https://www.ijert.org/design-of-a-lightweight-stream-cipher-bokhari-256 https://www.ijert.org/research/design-of-a-lightweight-stream-cipher-bokhari-256-IJERTV9IS030509.pdf Symmetric key cryptography is the most commonly used primitive and stream cipher, in particular, meets the requirement of such algorithms. Developing a software-based synchronous stream cipher is reduced to building a pseudo-random sequence generator with specified cryptographic properties. It is pertinent to note that the implementation of such reliable cryptographic primitives is extremely complicated in practice that requires small processing capacity, low volume, low area, and low power consumption. In the recent past, a few lightweight stream ciphers have been implemented for real applications. In this paper, we have proposed software-based synchronous lightweight stream ciphers, BOKHARI 256, mainly aimed for resource-constrained devices such as Radio Frequency Identification Devices (RFID) Tags, Wireless Sensor Node (WSN) and devices with limited processing capabilities, memory, power resources and the limited computational unit, insufficient wireless bandwidth and low ability to communicate and other general-purpose devices such as credit card, smart card, Personal Digital Assistant (PDA), etc. BOKHARI 256 has designed using the feature of some well-known stream ciphers like FRUIT, LIZARD, SOBER and Grain 128 to improve the performance. The cipher BOKHARI 256 uses a 256-bit key and initialization vector (IV) that is known to be safe and can withstand several cryptographic attacks. BOKHARI 256 uses eight variant stage LFSRs and a linear feedback function () for providing 256-bit security while the internal states and bit permutation use commutation relations of bitstream over (). We used some new design paradigm to fulfill the requirement of a low-cost environment as mentioned above. A. INTRODUCTION As we know that a shift registers can be easily implemented by computer hardware due to their less duty cycle and synchronous behavior. A linear feedback shift register (LFSR) is used to generate a wide range of pseudo-random sequences is the simplest type of feedback shift register. Because of LFSR linearity, knowing only output bits, we can test the LFSR using the algorithm given by Mandal, Kalikinkar, Xinxin Fan that generates any output sequence [1]. Klapper and Goresky [2, 3] proposed a new type of pseudo-random binary sequence generator called Feedback with Carry Shift Register (FCSR). FCSR had a shift register, feedback function, and a small amount of memory. In addition to the current memory contents, the register bits are added to the number. The parity bit (depending on ∑ ()) of the total is fed back into the first cell whereas the first cell is initialized with the higher-order bits depending on the location of |⌊∑ ()⌋| are fed back into the first cell and this new memory value is maintained [4, 33]. The key component used in the design of BOKHARI 256 is shown in Figure I. The key parameters associated with FCSR's is relation integer ′ ′ which is an odd positive integer ∀ ∈ ℤ. It represents the number of register cells in the structure. Further, assume that = ∀ ≥ and ′ ′ is an odd prime number such that is the primitive (), and − − leaves remainder nonzero when is divided by , so the maximal run length of the period of this polynomial ′ ′ is found: () = − − The relation between the cardinality of the registers ′ ′ and the connection integer ′ ′ is exponentially depended to one another and is given by − = and this implies that (+) =. Mathematically it is found that for any value of ′ ′, the expression (+) is real, so it is batter to accept the floor of this much amount. Hence the above relation gets expected value ⌊ (+)⌋ =. According to Niederreiter and Harald, the notion of the keystream's 2-adic complexity is also an important measure of the security of a Stream Cipher [5], it is possible to increase the 2-adic complexity of LFSR sequences by adding correct Boolean functions in the LFSR's output, but this issue has not received serious attention. Thus the purpose of this research work is to aim at exploring the possibility of designing a Stream Cipher model BOKHARI-256 using LFSRs for resource-constrained devices and protocols like Embedded Binary HTTP, WEB-HTTP and Compressed HTTP over PAN. Resource-constrained are likely to be extended to embedded computing systems implemented within the Internet of Things (IoT). B. BACKGROUND STUDY In order to propose a lightweight stream cipher, the following lightweight cryptographic model of the eSTREAM candidates has been studied. Traditional ciphers for stream encryption and pertinent security issues are presented in [29]. As referred in said work, ciphers Rivest Cipher 4 (RC4) [30], A5/1 and E0 although not completely compromised, but they suffer from serious security issues and should not be used in new applications any more [31, 34]. I.FRUIT In Fast Software Encryption (FSE), Vahid Amin Ghafari and et al [6] have presented a new idea for the design of Stream Ciphers FRUIT with a shorter internal state in 2015. FRUIT uses a secret key not only in the initialization phase of the model but also in the key generation phase of the cipher. The Fruit is proven to be much safe and ultralight than Grain. The main building block of the FRUIT uses Linear Feedback Shift Register and Non-Linear FSR. The size of LFSR and NFSR is 80 bits and 64 bits long IJERTV9IS030509 (This work is licensed under a Creative Commons Attribution 4.0 International License.) www.ijert.org