Abstract
Wireless Multimedia Sensor Network (WMSN) is an advancement of Wireless Sensor Network (WSN) that encapsulates WSN with multimedia information like image and video. The primary factors considered in the design and deployment of WSN are low power consumption, high speed and memory requirements. Security is indeed a major concern, in any communication system. Consequently, design of compact and high speed WMSN with cryptography algorithm for security, without compromising on sensor node performance is a challenge and this paper proposes a new lightweight symmetric key encryption algorithm based on 1 D cellular automata theory. Simulations are performed using MatLab and synthesized using Xilinx ISE. The proposed approach supports both software and hardware implementation and provides better performance compared to other existing algorithms in terms of number of slices, throughput and other hardware utilization.
Highlights
Security is a critical factor in every communication system in this world; may it be a simple short distance communication or communication between large servers that deal with a large volume of data
One of the recent trends of Wireless Sensor Network (WSN) is transfer of multimedia information like video, still images, audio etc., through self-organized networks. Such networks are called as Wireless Multimedia Sensor Networks (WMSNs) [1] [2]
The analysis showed that the Unicity Distance (UD) in the Improved-Data Encryption Standard (DES) is increased than the DES’s UD [12]
Summary
Security is a critical factor in every communication system in this world; may it be a simple short distance communication or communication between large servers that deal with a large volume of data. One of the recent trends of WSNs is transfer of multimedia information like video, still images, audio etc., through self-organized networks Such networks are called as Wireless Multimedia Sensor Networks (WMSNs) [1] [2]. A rule is a deciding function for each configuration, for the cell to have state 1 or a 0 in the generation. ( ) Reversible Cellular Automata (RCA) is defined as the high order CA in which the future Cxt+1 states of the ( ) ( ) grid of cells (Cx ) are calculated using the present Cxt and past Cxt−1 configuration of the cells. Second order CA is used to construct local transition rule function. RCA rule functions RCA rule-30 and RCA rule-45 are used to construct S-Box and key scheduling algorithm for KAMAR block cipher
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have