International Journal of Computational Engineering Research||Vol, 03||Issue, 5|| www.ijceronline.com ||May |2013|| Page 40 Fast Encryption Algorithm for Streaming Video over Wireless Networks 1 Mr.Rahul Bambodkar 2 Mr.Avinash Wadhe 1 Lecturer (CSE),D.M.I.ET.R, Salod (HIrapur) Wardha. 2 G.H Raisoni College of Engineering, Amravati. I. INTRODUCTION Advances in multimedia and wireless technologies have led to the recent wide deployment of streaming video over wireless applications and services that suffer from piracy and malicious attack. The security becomes a critical issue in the design and development of such multimedia applications. Assuring a certain level of security is a strong requirement for a large deployment of multimedia applications. Failure to meet security requirement poses potential threats to the service providers and customers. Encryption for the video bit stream should be designed to be lightweight and format-compliant. Since video decompression on the handheld devices is constrained by the limited power and other computation resources, conventional ciphers such as data standard encryption (DES) or advanced encryption standard (AES) to wireless applications over handheld devices are intensive computation tasks. Therefore, it is not efficient to apply conventional ciphers for wireless multimedia applications. Selective encryption algorithms are proposed to be an economical and secure video encryption algorithm where only I-frames are encrypted. However, it has been reported as not good choices in the encryption of digital video since encrypting I-frames alone may not be sufficiently secure for digital video [1]. Compression-Logic based encryption is widely studied and several algorithms have been proposed [2,3,4,5,6,7,8,9,10,11]. However, these compression-based algorithms suffer either vulnerability or low-efficiency problem. In this paper, a new compression-based video encryption algorithm is proposed. The new algorithm overcomes the reported vulnerability and at the same time, relatively low computation complexity, low compression overhead, high scalability are maintained. Also, the new algorithm confines the encryption-incurred error propagation. Quick recovery from bit errors and fast resynchronization from packet losses are feasible.. II. RELATED WORK The output of video compression is a sequence of three types of frames: I-frame (Intra picture), P- frame (Forward Predicted) and B-frame (Bidirectional Predicted: Forward-Prediction and Backward- Prediction). I-frame is reference frame and is self-contained. A P-frame specifies the difference between the previous I-frame and itself; while a B-frame is an interpolation between the previous and subsequent frame of I or P type. To compress an I-frame, the process starts from dividing the frame into macro-blocks. Each macro- block is of size 16×16 pixels. And each macro-block is composed of six blocks, four of them represent luminance and the other two represent chrominance. Each block of size 8×8 is through a discrete cosine transformation. ABSTRACT: Wireless networks are poised to enable a variety of existing and emerging video streaming applications. However, video streaming over wireless suffers from piracy and malicious attack. Also, it is well-known that video decompression on the handheld devices is constrained by the power and other computation resource. Therefore, video encryption should be designed to be lightweight and efficient. In this paper, we designed a new lightweight, efficient, scalable, format-compliant video encryption algorithm, which is based on the DCT (Discrete Cosine Transformations) coefficients scrambling. The simulation shows that the proposed video encryption algorithm consumes low computation resource while achieves high scalability and confidentiality, which is in compliance with the design goal of video streaming over wireless applications. Keywords— video, encryption, security, wireless networks