Novel and Efficient Cellular Automata Based Symmetric Key Encryption Algorithm for Wireless Sensor Networks

Abstract

Our proposed method L2D-CASKE, the lightweight 2-dimensional (2-D) Cellular Automata (CA) based symmetric key encryption algorithm is a 128 bit length that allows a key length of 128 bits. It is designed as a lightweight encryption algorithm. As being light weight, it can be easily applied on small devices such as wireless sensor motes, smart cards and other PDAs. An encryption algorithm having simple loop operations, based on iterative parameters is used in this work. A number of sequences and operations are used for this purpose. In this paper, the well designed algorithm was verified using MATLAB 7.7 (R2008) tool and the hardware synthesized on Field Programmable Gate Arrays (FPGAs). To achieve this, our algorithm uses loop design based on iterations and the same is realized on FPGA. Advantages of our algorithm can be listed in terms of its flexibility for a set of given constraints, less complexity involved in its performance. This is achieved through the usage of generic VHDL coding. Virtex-4 XC4VL25 -10ff668 is used as a test device in Xilinx 9.1 for realizing our algorithm.

A New Mathematical Model for Controlling Tumor Growth Based on Microenvironment Acidity and Oxygen Concentration

“…In this paper, the diffusion (propagation and redistribution) of metabolic factors has been simulated relying on Block Cellular Automata (BCA) paradigm [ 45 – 47 ] which implements simple rules. First, the lattice is split up into 3 × 3 nonoverlapping blocks ( Figure 2 ).…”

KAMAR: A Lightweight Feistel Block Cipher Using Cellular Automata

“…For comparative discussions, a few implementations results of block ciphersL2DCASKE [10], SEA [19] [20], AES [17] [18] [21], DESXL [22], PRESENT [23], XTEA [24] are presented in Table 2. The symbol # denotes the block ciphers that are implemented straightforwardly in to the same FPGA device to aid precise comparative analysis.…”

“…A new generation is created according to some mathematical fixed rule called local update rule function or simply rule function. This local update rule function is applied to the whole grid simultaneously and the new state of each cell in terms of the current state of the cell and the states of the cells in its neighbourhood is determined [8]- [10].…”

“…These 256 CAs invented by wolfram [6] are generally referred as Wolfram code, who numbered each rule from 0 to 255. The rule 30, 45 and rule 110 CAs are predominantly attractive in applications of cryptography [9] [10]. These rules are of attractive because they generate composite and random patterns.…”

Research on a more safe image encryption communication algorithm

“…These methods include disambiguation-based, disambiguation-disambiguation network, hash-based methods, etc., each of which has its unique advantages and limitations [3]. Some traditional image encryption methods rely heavily on disambiguation techniques, such as disrupting the order of pixels or performing pixel substitution [4][5][6].…”