SYNOPSIS

ON

GUI TEST SUITE REDUCTION by

ABHISHEK AGARWAL (1109110901) LOKENDRA KUMAR(1109110908) SUMIT PAL (1009110115) SUBHSHREE MANDAL(1009110102) Submitted to the Department of CS/IT in partial fulfilment of requirements of the degree of Bachelor of technology Information Technology

JSS ACADEMY OF TECHNICAL EDUCATION MTU, NOIDA

Project Objective:-Achieving compressed & secure multimedia transmission

over network by implementing ECC technique .

Introduction:The unique characteristics of the elliptic curve cryptography (ECC) such as the small key size, fast computations and bandwidth saving make its use attractive for multimedia encryption. In this study, the ECC is used to perform encryption along with multimedia compression, and two ECC-based encryption algorithms are introduced and applied before and during compression. The first algorithm performs selective encryption on the transform coefficients during compression, whereas the second algorithm achieves perceptual encryption based on selective bit-plane encryption before compression. It is shown that ECC is highly efficient and does not affect the compression efficiency, and accordingly can meet the multimedia encryption requirements. The protection of multimedia content can be achieved using encryption algorithms. Two approaches are proposed in the literature for multimedia encryption: naive encryption and selective encryption. In naive encryption, the entire multimedia stream is encrypted after the compression using the conventional cryptographic algorithms such as Data Encryption Standard (DES) and Advanced Encryption Standard (AES) . Owing to the real-time requirements of multimedia streaming, the naive approach is not efficient to encrypt such data. On the other hand, selective algorithms are proposed to exploit the characteristics of multimedia compression algorithms and encrypt only parts of the contents in order to achieve the requirements of multimedia streaming. This is referred to as perceptual encryption and is considered as part of the selective encryption. the application of symmetric key over multimedia networking applications (e. g. multicasting) is not practical because each participating entity requires to store the keys of all other entities. To solve these problems, a new trend of public key cryptography is introduced which is referred to as elliptic curve cryptography (ECC). It has been shown that ECC is suitable in the environments where processing power, storage, bandwidth or power consumption is constrained . we apply

ECC to selectively encrypt portions of the multimedia data along with compression in order to meet the real-time requirements of multimedia encryption.

Requirements of multimedia encryption:

1. Compression efficiency: Compression algorithms are used to reduce storage and make data rates appropriate to the available network bandwidth. Hence, the cryptographic algorithm should not increase the volume of data to be stored or transmitted. 2. Encryption efficiency: Even if multimedia streams are compressed, they still have large amount of data. Thus, applying conventional cryptographic algorithms to encrypt the multimedia data is not efficient, since theses algorithms are CPU-intensive and are designed specifically for encrypting text data. Accordingly, specific algorithms are preferred to achieve multimedia encryption and decryption in order to meet the real-time constraints of multimedia applications. 3. Codec compliance: Multimedia applications use a specific standard codec to perform compression and decompression. Therefore it is preferred that the encryption algorithms do not need modifications to the codec. 4. Security level: The security of multimedia applications is application-specific; it is differentiated according to the level of security they require. For instance, the security for entertainment applications such as video on demand requires less level of security than other sensitive applications such as business meeting video conferencing. Possible positions of multimedia encryption algorithms

Multimedia compression and encryption The encryption algorithms that work jointly with the compression algorithms are called joint compression and encryption algorithms, whereas the algorithms that work independently of the compression algorithms are called compression-independent encryption algorithms. In joint compression and encryption algorithms, encryption is performed during compression; it can be within or after transformation, quantisation or entropy coding . On the other hand, in compression-independent encryption algorithms, encryption can be before compression or after compression.

ECC over finite field GF(p)

An elliptic curve, Ep(a, b), is the set of solutions (x, y) to an equation of the form y2 = (x3 + ax + b)mod p, where (4a3 + 27b2)mod p 0, together with a point at infinity denoted O. The ECC operations are defined only over the curve domain and any change in the value of a or b gives a new domain of solutions for ECC. The ECC domain parameters that must be known by all participating entities are the constant values a and b, generator point on the curve (G), and prime number p, where ECC is defined over the finite field GF(p). The public key is a point in the curve, while the private key is a secret random number generated by the owner entity. The public key is obtained by multiplying the private key with the generator point G in the curve, and this operation is called point or scalar multiplication [31]. In point multiplication the chosen point from the curve is multiplied by a scalar integer, which is achieved using two operations called point addition and point doubling. Point addition is the addition of two points P and Q on an elliptic curve to obtain another point R on the same elliptic curve. Point doubling is the addition of point P on the elliptic curve to itself to obtain another point R on the same elliptic curve. The rules of addition over Ep(a,b) are defined as follows: 1. P + O = P. 2. If P = (x, y), then P = (x, y). 3. P + (P) = O. 4. If P = (x1, y1) and Q = (x2, y2) with P Q, then R = P + Q = (x3, y3)

ECC Implementation over GF(p)

The chosen domain parameters for ECC implementation over the modular arithmetic field GF(p) are tabulated in Table 1: p is the prime number defined for finite field GF(p), a and b are the parameters defining the curve y2 = x3 + 2x + 7 mod 53330939, G is the generator point (x, y); a point on the elliptic curve chosen for cryptographic operations, and n is the order of the elliptic curve in which the scalar of point multiplication is chosen as a number between 0 and n 1.

Message encryption and decryption with E53330939(2,7) After encoding message m into point Pm on the elliptic curve E53330939(2,7), we select the generator point G(503152, 736), and then each entity that participates in the communication chooses a private key. For example, entity A chooses a private number nA and computes its public key PA = nA G by multiplying point G with scalar nA. The same process is repeated for all entities. For entity A to encrypt and send message Pm to entity B, A chooses a random positive integer k and produces the ciphertext Cm of two points as follows

where PB is entity B public key. Entity B can decrypt the received ciphertext Cm by multiplying the first received point in the pair with its private key and then subtract the result from the received cipher of the second point as follows

Multimedia cryptography using E53330939(2,7)

Cameraman greyscale image (a) and its 8 bitplanes (b)(i) from bitplane 8 to bitplane 1, respectively

The results of applying E53330939(2,7) to encrypt the quantised DC coefficients of the Cameraman image are shown in Fig. 7. Fig. 7a shows the original image, whereas Fig. 7b depicts the perception after encrypting only the DC coefficients of the original image. Fig. 7c shows the image after decryption and decompression using inverse DCT. To degrade the image perceptual quality, we considered three cases: (i) encrypting only bitplane 7; (ii) encrypting only bitplane 8; and (iii) encrypting both bitplanes 7 and 8. Fig. 8 shows the results of applying E53330939(2,7) to encrypt only bitplane 7 of the greyscale Cameraman image. The figure depicts the perceptual quality of bitplane 7 before and after encryption. Fig. 9 shows the results of applying E53330939(2,7) to encrypt only bitplane 8 of the Cameraman image. The figure depicts the perceptual quality of bitplane 8 before and after encryption. Fig. 10 depicts the perceptual quality of the Cameraman image with its higher-order bitplanes encrypted. Fig. 10a shows the case of encrypting only bitplane 7, whereas Fig. 10b shows the case of encrypting only bitplane 8. Fig. 10c depicts the perceptual quality of the Cameraman image when both bitplanes 7 and 8 are encrypted.

References www.ietdl.org Gupta, K., Silakari, S.: Efficient hybrid image cryptosystem using ECC and chaotic map Forouzan, B.A.: Cryptography and network securit