# Introduction

ryptography is the study of transmitting secret messages securely from sender to receiver. [4]The original text, called plain text it's encrypted form is called cipher text, which is sent to the receiver. The recipient decrypts the text to get the plain text. The model of secret key system, first proposed by Shannon ( [4]) is shown in figure1.

Figure 1: The model of secret key system proposed by shannon There are many algorithms had developed to providing security of information but each of them having some merits and demerits. There is no single algorithm is sufficient to provide security. In this paper, an effort has been made to develop a new block cipher algorithms using a set of 16 grids where each grid is 4X4 matrix [2]. Each grid is capable to store 16 characters and finally, all ASCII characters value has Author : Assistant Professor Department of Computer Science Sri Ram Murti Smarak College of Engineering & Technology, Bareilly, (U.P.), India. . E-mail : rajukushwaha36@gmail.com been stored in grid set. The algorithm has been performing two steps. In first step, the plaintext has been broken into number of block eight characters. Each character from each block has been converted into bit stream and placed in the grid set. After placing all characters, new bit stream for each character of the block has been calculated using grid number, row number and column number. In second step, the stream bit is consist of eight bit for single character, calculate their decimal value and assigns the ASCII character for this decimal value. [6]To ensure the security of encryption algorithm many effects have done. These are avalanche, bit ratio, non-homogeneity and time complexity. The avalanche effect means a small change in plain text (or key) should produce a significant change in cipher text. [4]The bit ratio effect means the changes the bit values from same position between plain text and cipher text. The non-homogeneity test is a technique to test nonhomogeneity of the source and encrypted file. The time complexity defines how efficiently the proposed algorithm will encrypt the plain text and decrypt from encrypted text.


# II.

Literature survey [4] In this paper, the Frame based encryption process is proposed, this is also block cipher scheme which break the plain text into eight character size block. Find their positional value from the frame and put their corresponding ASCII value. This forms a 8-bit stream of data which is swapped with another string and generate their ASCII character. This character is send to the receiver.

[2] In this paper, the proposed algorithm used the 26 characters, 10 numerals and single space character. This form a block of 37 characters, when plain text is encrypted into cipher text the plain text character is taken their value from this block of 37 character and form a matrix of order 3*3. Select a Key matrix of same order and encrypt the data with this process and result is taken modulus by 37. Cipher text is generated and sends to the receiver. [5] In this paper, the proposed algorithm compress the plain text with arithmetic algorithm the resultant value of compress data is encrypt with RSA algorithm, the cipher text is generated and send to the receiver.

Hill cipher's or linear block cipher is susceptible to cryptanalysis and unusable in practice, still serves an important pedagogical role in both cryptology and linear algebra. It is this role in linear algebra that raises several interesting questions [1].

In this paper, the proposed algorithm is a modified form of RSA algorithm named RSA1, which enhance the security of RSA algorithm. The resultant value of RSA algorithm is converted into corresponding ASCII character value and then send to the receiver. [7] III.


# Proposed work

The algorithms are based on the grid. A single grid consists of 16 characters. Then total number of grid is16 required for representing ASCII set. The total ASCII character are 256.


# Algorithms: a) Sender Prospects: Encryption

Step 1: Represent each character of plain text by another character which is equivalent a number, generated from reference grid model .Then, the substitute character is represented by the bit sequence (x,y,frame no).

Step 2: Grouping the modified plain text into blocks of eight characters. If modified test is not properly divided by eight then blank characters will be padded with last block.

Step 3: Convert each block into equivalent bit streams.

Step 4: This bit stream converted into Decimal equivalent.

Step 5: Apply RSA algorithm to encrypt this decimal value.

Step 5.1: Select two prime number P,Q; Calculate n=P*Q;; Calculate _(n)= (P-1)*(Q-1); Select integer e; gcd(f(n),e)=1; 1<e<f(n); Calculate d; d=e^-1 mod f(n); Public key KU= {e, n}; Private Key KR= {d, n};

Step 5.2: Encryption Plain text : M< n Cipher Text : C=M^e (mod n);

Step 6: This Decimal value is changed into ASCII character. This is cipher Text.

Step 7: Repeat steps 2 to 5 until all characters of plain text become converted into cipher text.


# b) Receiver Prospects


# Decryption

Step 1: Take cipher text and extract ASCII Character Value individual.

Step 2: Change this value into decimal Equivalent.

Step 2.1: Decryption Cipher Text : C Plain Text : M = C^d (mod n);

Step 3: Convert this decimal into bit stream.

Step 4: First Two bit represent X-axis, Second two bit Represent Y-axis and remaining four bit represent grid number. Match bit stream with above process and take the ASCII value.

Step 5: Convert This ASCII Value into Character set.

Step V.


# Conclusion & future scope

It is observed from the result the proposed algorithm is extremely efficient and a sufficiently strong encryption algorithm enhance the security of data transmitted over covert channel. A degree of freedom value of 256 ensures the maximum variety of characters in the cipher text which ensures its strength against an attack. Frequency Distribution also speaks the encrypted character evenly distributed from 0 to 255. So, it has been made more difficult for attacker to recover plain text from cipher text. This algorithm provide security over data in two ways , Firstly the arrangement of grid is only known by both parties only and secondly the key is used in RSA algorithm is also unpredictable by the intruders. There is some extra effort have made in grid and their storage format then this algorithm give more better result in terms of security and speed of encryption & Decryption.
2![of the paper deals encryption technique. Part 3 deals with proposed technique. Part 4 consist of experimental results. Part 5 deals with Securities level testing for the proposed algorithm. Part 6 are Conclusions. At end of paper References are given.](image-2.png "Part 2")
![](image-3.png "")
IV.Resulta) Sender ProspectsTake the word "Crypto" encrypt this with thehelp of above algorithm.PlainASCII(X,Y,Bit streamConverttextValueGrid No)decimal NoC670,3,30011001151R1140,2,600100110382012Y P T121 112 1162,1,6 0,0,6 1,0,610010110 00000110 01000110150 70 06MayO1113,3,511110101245Apply RSA algorithm to encrypt this decimalvalue and the resultant cipher text is== 3&--F<õb) Receiver ProspectsSender & Receiver both are well knownalgorithm & encrypted text is in ASCII Format. Receivethe Cipher Text C= 3&--F<õ , Apply RSA algorithm todecrypt the cipher text in Decimal value format.DecimalBit Stream(X, Y,ASCIIPlainValueGridValueTextNo)51001100110,3,367C38001001100,2,6114R150100101102,1,6121Y70000001100,0,6112P( D D D D ) E06 24501000110 111101011,0,6 3,3,5116 111T O
		
		
			

				


* 
	
		Communication Theory of Security System
		
			CEShannan
		
	
	
		Bell, System Technical Journal
		
			28
			
			1949
		
	




* 
	
		A New Encryption and Decryption Algorithm Combining the Features of Genetic Algorithms(GA) and Cryptography
		
			GNalini
		
		
			RaghavendraRao
		
		
	




* 
	
		Cryptography and Computer Privacy
		
			HFeistel
		
	
	
		Scientific American
		
			228
			5
			
			1973
		
	




* 
	
		Frame Based Symmetric Key Cryptography
		
			SatyendranathUttam Kr Mondal
		
		
			Mondal
		
	
	
		Int. J. Advanced Networking and Applications
		
			
			2011
		
	




* 
	
		Confidentiality & Authentication Mechanism For Bio-Metrics Information transmitted over Low Bandwidth channel
		
			RajuSingh
		
		
			AKVatsa
		
	
	
		International Journal of Network Security & it's Application
		
			3
			3
		
	




* 
	
		
			JohnCBowman
		
		Math 422 Coding Theory & Cryptography
				Edmonton, Canada
		
		
			University of Alberta
		
	




* 
	
		RSA-2 Algorithm Speed and Security enhancement through public key cryptography
	
	
		International Journal of Engineering Science & Technology
		
			2
			8
			
			2010
		
	
	J. SaiGeethaet. al.