Bhumika Gupta

Dual Level Security for Key Exchange using Modified RSA Public Key Encryption in Playfair Technique

The objective of this paper is to provide the dual level security for the key in playfair cipher using modified RSA digital signature scheme. This work has two phases, in the first phase the key is converted into the ASCII code and in the second phase, this work is using the concept of modified RSA digital signature scheme in which user authentication, data integrity and non-repudiation services are provided but as all know that in playfair technique, key exchange process is most important so there is a need to secure the key during key transfer that’s why this work is using the concept of modified RSA public key encryption technique to encrypt the key before sending it to the receiver for decryption. This work use a 10*8 matrix which contain all alphabetic in the uppercase as well as in lowercase, the numeric value from 0 to 9, list of operator and list of bracket. General Terms Key Security.

Enhanced the Security of Playfair Technique using Excess 3 Code (XS3) and Ceasar Cipher

The main purpose of our research is to provide security for the data that contains alphabets and integer values during the transmission, when data is transmitted form sender to receiver. As we know that playfair technique if best for multiple letter encryption, which treats the plain text as single units and translates these units into cipher text. It is highly difficult to the attacker to understand or to decrypt the cipher text. The existing playfair technique is based on the use of a 5 X 5 matrix of letters constructed using a keyword. This algorithm can only allow the text that contains alphabets only. But many algorithms have been proposed that allow text which contains alphabets, integers as well as special symbols using 6 * 6 matrix and 10 * 9 matrix etc. In playfair technique a groups of 2 letters in the plain text is converted to cipher text during encryption using a key. Similarly on other hand during decryption cipher text are converted to plain text using the same key. Some time it may be possible for the attacker to understand the plaintext. To overcome this problem we proposed an algorithm that extends the security of playfair technique using excess 3 code and ceasar cipher technique where first each alphabets and integer is converted into binary number and then its equivalent excess 3 code and after that with the help of key encryption process will be apply. In our proposed technique we are using 6 * 6 matrix which contain alphabets and integers only. General Terms SECURITY

MDS 3 C: Modified Digital Signature Scheme for Secure Communication

When it comes to security no one can be trusted, there may be situations, when sender’s and receiver’s authentication is required. Digital signature is used to provide the authentication to assure receiver about the message and its sender. Digital signature is an authentication mechanism which generates a unique code with the message, now this attached code (i.e., signature) is responsible for the validation of sender and message. As all know that digital signature provides authentication, message integrity, and non-repudiation services, but does not provide the confidentiality of data as well as signature which is most important during data transfer. This paper proposed a modified digital signature scheme for secure communication. This work includes the concept of public key encryption for secrecy of data. This work will reduce the well-known drawbacks of digital signature scheme. The aim of this technique is to provide the secure communication that includes the security for the data, private key, and digital signature.

Adaptive Byte Compression and Decompression: A New Approach for Fractal Image Compression

This paper addresses the area of image compression as it is applicable to various fields of image processing. On the basis of evaluating and analyzing the current image compression techniques this paper presents the Adaptive byte compression and decompression technique an approach applied to fractal image compression. It also includes various benefits of using image compression techniques

Implementation and Result Analysis of Secure Strategy for High Speed Transmission and Efficient Collection of Data in Wireless Sensor Network

In this work, the main focus is to provide Security in WSN (wireless sensor networks) as well as to provide the strategy to collect the high speed data in an efficient manner. Sensor networks are usually deployed in hostile and unattended environment where an adversary can read and modify the content of the data packet. In such situation the most popular type of attack is the external attack and replay attack. The node needs to be authenticated before data transmission takes place. In external attack the node does not belong to the network try to read and modify the packet. For that we also need to authenticate the node before data transmission. To overcome this problem we are using the concept of public and private key (Modified RSA Digital Signature Scheme). So this work tries to develop an algorithm which will form a network structure in wireless sensor network through which data can be transmitted faster to the base station without affecting life time of network and it also provide the security during communication. The cluster head in a cluster is generally involved in long distance transmission that‟s why its energy level decreases faster than other cluster members in a cluster. To overcome this problem we used the concept of reclustering to rotate the responsibility of cluster head among the cluster members in a cluster so that energy can be properly distributed among the nodes. General Terms Data Security.