Transform Operator Random Generator Delimiter Based Encryption Standard (TORDES)

Ajay Bhushan
Department of Information and Technology Galgotias College of Engineering and Technology Greater Noida India E mail: ajay2007bhushan@gmail.com

Abstract This paper describes cryptography, various

symmetric key algorithms TORDES in detail and then proposes a new symmetric key algorithm. Algorithms for both encryption and decryption are provided here. It is a new approach in which we use the concept of stack, transform and random number with a symmetry key .This will give high throughput for both encryption and decryption with high rate of security. This is implemented successfully on text files .The advantages of this new algorithm over the others are also explained.

Keywords Data, Encryption, Stream, Decryption Random

number, Transform, Operators, Network security, Symmetric Key.

1 Introduction
With the incessant development of the network have increased dramatically over the past decade. Security of these data becomes even more critical when they are confidential data. Plenty of safety approaches are available to transfer data within the organizations premises. But when data need to be transferred over the network companys premises, then there is a need of a protection technique which is not only secure but also efficient for transferring the data quickly. This technique can be broadly classified into two categories: Steganography and Cryptography. Steganography can be described as the technique for hiding a secret message within a larger one such that no one except the sender and receiver suspects the contents or even the existence of the hidden message. This approach has been used since ancient times; for example Greek kings used to tattoo secret information on slaves head and then hide it by growth of his hair. Later information was retrieved by shaving his head at the receiving end. However, steganography is not vastly popular and rarely used these days. Most famous and widely used approach for secure communication is Cryptography which is the practice and study of hiding information. Cryptography word is derived from the Greek word kruptos, meaning "hidden". It is normally also referred as Encryption, which is used to disguise data, making it unintelligible to unauthorized observers. Decryption is the reverse process i.e. moving from the unintelligible cipher text back to plaintext. The main advantage of cryptography is that communication between both sending and receiving ends remains inconceivable by anyone who might be listening. Cryptography helps us to achieve three main security goals i.e. availability, confidentiality and integrity of the information. One example of cryptographic application is machine used by Germans during World War II to communicate safely within their defense forces and avoid eavesdropping. One way to classify cryptography is the key mechanism. Key can be defined as the rules which are Responsible for converting plain text

into cipher text. Depending upon the Key, cryptography can be alienated into two chief categories: Secret Key Cryptography and Public Key Cryptography. Secret Key Cryptography uses same key (single key) for encryption and decryption of data, while Public Key Cryptography uses two mathematically related keys; one for encoding data at sending end and another for decoding data at receiving end [8]. The former approach is simpler but distribution of secret key is the chief concern. The later approach is a bit complex due to two keys: private key and public key. The sender can use public key (available to everyone) of any individual or organization to send data and that data can only be decoded using the private key which is kept confidential (with the receiving person or organization) and thus making it more secure and widely accepted across the world. Another nomenclature of cryptography takes in account the number of characters read in a single pass. First category is known as Block Cipher, which inputs a block of digits/ characters in a single pass and encodes it simultaneously. However this technique is faster but it may produce identical cipher texts for the same plaintext every time it is encrypted. Second type is known as Stream Cipher, which encrypt plain text digits/characters one at a time.

2 TORDES new proposed algorithm

We have introduced a new partial symmetric key algorithm TORDES which will put a real challenge on network security[8]. It has less complexity but gives high performance. It uses 32 bit key and multi operation with multiple binary operators, delimiter with two time transform and random number generator. It is basically a secret key algorithm where we have introduced a 32-bit key and also used multiple binary operators and some delimiters, which are chosen randomly from predefined stacks along with a code sequence [1]. In spite of a secret key algorithm [7], it does not entirely depend on the key. As such, if the key value is known, then also it is impossible to decipher it without the knowledge of decryption algorithm as well as code sequence generated from that particular processing. It is worthwhile to note here that for the same text and the same key, cipher code is different for each and every processing. This thing makes this algorithm stronger with small size key. Many new models has been come in the market to make secure the data communication but due to time factor the security of old model is not trusted because of their week structure. Tordes will overcome these drawback of old algorithm and make it secure over communication channels. In transform operation we use inverse function. We take a byte of binary string and take inverse of it and then take next byte and perform same operation for it. Random generator sequence length and Overall system memory capacity will affect the RDEA. Nalini N et al. have proposed an AES

(Advanced Encryption Standard) algorithm; the problem is the weakness of linearity existing in the S-box and key schedule [19]. In order to keep from the new attacks and implement the AES for secure communication, and give out a new implementation scheme for increasing complexity of nonlinear transformation in design of Sbox. The default algorithm in this method is AES with 128,192 and 256 bits keys [20]. The principle weakness is the problem of linearity in the S-box and key schedule.

2.1 Encryption procedures using TORDES

2.1.1 Algorithm
In this algorithm we use transform operation and then use two types of predefined stacks one is combinations of operators and second is delimiter, A Random genitor is used in this algorithm. Step1: Read a character from the text file corresponding to a text to be encrypted. Now get the ASCII value of that character. Step2: Take the binary equivalent of this ASCII value. Step 3: Transform the binary string with byte by byte. Step4: Now read the binary string. Step5: Performing mathematical operation using operators from the operator stack over the bits, using the secret key. Step6: To maintain secrecy of operators used as above, encode the operators using lookup table. Step7: Generate a random number. Step8: Add the corresponding character of the generated random number to the code sequence. Step 9: Choose a random delimiter from the predefined stack and add it at the end of the code sequence. Step 10: Start from left take first nibble take its mirror image, leave next nibble and go till end of string. Step 11: Repeat the above steps for next character of the file until end of file reach. This can be shown with the help of diagram

For example take a word doctor. The ASCII value of d is 100 and in binary it is 1100100. After transformation it comes to be 00100110 1 and* 100*3=300 0 continue + 0 continue * 1 and+ 300+3=303 1 and 303-3=300 1 and * 300*3=900 0 continue -

2.2 Decryption using TORDES 2.2.1 Algorithm

Step1: Read the first character from the cipher text and see the ASCII value for it. Step 2: Take the binary equivalent of this ASCII value. Step3: Start from left take first nibble take its mirror image, leave next nibble and go till end of string. Step4: Check the key and examine the character before the delimiter in the code sequence. Step5: Perform similar mathematical operations with character depending on the nature of the key. . Step6: Decode the code sequence and perform inverse operation for each and every character of the code sequence. Step7: Transform every byte in string, Step10: Read the ASCII value for this binary string and calculate the character. Step11: Repeat the above step for next character. This can be shown with the help of diagram

2.1.2 Example Here there are two predefined stacks and let the key value is 3. 1st Stack * + - + * - - + * 2nd Stack @ # ~: $

4. Languages suitable for TORDES

This algorithm can be implemented on all open sources and other language like PHP, java, C, C++, Dot Net and there is no such

restriction of language in this algorithm. However this may be implemented on Dot Net with some restriction.

Algorithm

Key length (bits) 56 56*3 128 32

Plain text (bits) 64 64 128 32

Cipher text (bits) 64 64 128 32

DES

5. Hardware suitable for TORDES

DES3

It appears that star topology [7] is the most suitable network architecture for implementation of this algorithm. In this each node is connected to the hub with a
point-to-point connection. All traffic passes through the computer that serves as a repeater or signal booster in this first sender and receiver agrees on a common key value that is stored on central database. Now the text is send by sender in encrypted form. The receiver will recover the actual text using common key and inverse step that are performed by algorithm. Star topology can be shown with the help of diagram. In actual practice a switch or hub is placed at central place and the entire computer are connected peer to peer with this central hub or switch.

AES PROPOSED

From the above table it has been shown that the proposed system requires only few amount of memory as compared to other algorithms. Basically the encryption time increases as the key length increases.

5.2. Encryption/Decryption Algorithms

Time

of

Different

The proposed method has been implemented based on multi threading concept, which helps in efficient utilization of CPU. Hence encryption and decryption time is very optimum as compared to existing methods [8]. Below table and graph shows the time (seconds) required for encryption and decryption of text file of size 20,527bytes.
Algorithm Encryption Decryption Total Input Text file DES TDES AES Proposed

20,527

2 17 19

7 58 65

4 62 66

10 4 14

Fig3: Model architecture for MODDES

Now the receiver client on request may get the cipher text only from the server on production of key value. However, if he wants to decrypt the cipher text, he is required to use a key value, the same code sequence available in the server and the decryption algorithm. The server has to be distributed in nature as well as multithreaded. So, each and every request will be handled by a certain thread. So, only the thing kept in mind at the time of designing the server program is, it must be thread safe [1]. If the server doesnt support multi-threading facility, then for better performance, server maintains storage for the code sequence along with an indicator. If the corresponding client (who asks for that particular file) can decipher that cipher text successfully, by using the code sequence which is already delivered to the server from the sender end it sends a green signal to the server (i.e. true). Unless and until the server gets the green signal it will not clear the code sequence storage and the indicator value will remain false. In the mean time it will not receive any further request from that particular client for that same file.

6. ADVANTAGES OF THE TORDES

1. The Algorithm is very simple in nature 2. There are more operations present in this algorithm which would make it more secured. 3. For a small amount of data this algorithm will work very smoothly.

7 Conclusions
In this paper we have tried to benchmark performance analysis of popular secret key algorithms i.e. DES, TDES, and AES with TORDES algorithm. It has been proved that performance and security provided by TORDES algorithm is better than other secret key algorithms for small messages. A proposed direction for the future work could be to analyze the following factors. i) Key values steganography along with cipher text ii) Key factors for implementations like features with operating system, networking, etc. iii) The hardware implementation of TORDES in EVM and other machines

5 Performance Evaluations
5.1. Memory Space Requirement
The following table shows that memory requirement of proposed system is lesser as compared to existing system.

REFERENCES
[1] A Comparative Study of Performance based Crypto Analysis Features for Standard Data Encryption Algorithms with (MODDES). 2010 [2] P.Gope, Multi Operator Delimiter based Data Encryption Standard (MODDES), ICCNT 2009

[3] National Bureau of Standards Data Encryption Standard,

FIPS Publication 46, 1977. [4] NIST, Advanced Encryption Standard Call, NIST, 1997. http://www.nist.gov/AES[4]/ [5] Twenty Second National Radio Science Conference (NRSC 2005), RDEA Algorithm. [6] Daemen, J., Rijmen, V.: AES [4] Proposal: Rijndael,
Banksys/Katholieke Universiteit Leuven, Belgium, AES [4]

[7] http://www.rsasecurity.com/company/news/releases/pr.asp? doc_id=462 submission, June 1998. [8] W.Stallings Cryptography and network security principles and practice, Fourth edition, Prentice hall, 2007 [9] Park Stephen K. and Keith W. Miller, "Random Number Generators
Good ones are hard to find", Communications of the ACM, October 1988. [10] "Basic Cryptographic Algorithms", an article available.www.itsc.state.md.us/oldsitelinfo/intemetSec-urity/ Crypto/Crytolntro. htm#Algorithms. [11] KUI-HE YANG, SHI-JIN NIU, Data Safe Transmission mechanism Based on Integrated Encryption Algorithm, 2009. [12] Tingy uan Nie, Teng Zhang,, A Study of DES & Blowfish Encryption Algorithm, 2009. [13] Fan Jing, Zhu Xian, Data Encryption by Two Keys,2009. [14] http://searchsecurity.techtarget.com/definition/cryptanalysis [15] P.P Charles & P.L Shari, "Security in Computing: 4th edition", Prentice-Hall, lnc.,2008. [16] van Tilborg, Henk C.A. (2000). Fundamentals of Cryptology. Kluwer Academic Publishers. pp. 3. ISBN 0-7923-8675-3. [17] http://www.randomnumbers.info/content/Random.htm [18] http://www.design-reuse.com/articles/13981/fpga-implementationof-aes-encryption-and-decryption.html [19] Nalini N, AES Algorithm Implemented for PDA Secure Communication with Java, 2007. [20] Daemen, Jjmen, V.:AES Proposal: Rijndael, Banksys/Katholieke, R Universiteit Leuven, Belgium, AES submission, June 1998 [21] D. Clark, Policy Routing in Internet Protocols, RFC 1102, SRI Network Information Center, May 1989. [22]Wikipedia.com

public static char getDel() { Random r=new Random(); int n=r.nextInt(10); return delus[n]; } public static void getInitDel() { toup=0; }} class ajay{ public static void main (String [] args) { try { SecretKey key = KeyGenerator.getInstance("DES").generateKey(); // Create encrypter/decrypter class DesEncrypter encrypter = new DesEncrypter(key); // Encrypt encrypter.encrypt(new FileInputStream("xyz.txt"), new FileOutputStream("plain.txt")); // Decrypt encrypter.decrypt(new FileInputStream("ciphertext.txt"), new FileOutputStream("encrypt.txt")); } catch (Exception e) { System.out.println("error"+e); } } }

Results
File transfer from one system to another

Code for TORDES package ds; import java.util.*; public class PStack2{ /*static char st[]={'*','+','-','*','+','-','*','+','-','*','+','-','*','+','-','*','+','-','*','+','-','*','+','','*','+','-','*','+','-','','+','-','*','+','-','*','+','-','*','+',' -','*','+','-','*','+','-','*','+','-','*','+','-'};*/ static char st[]={'*','+','-','+','*','-','-','+','*','-','*','+','+','-','*'}; static char delus[]={'@','#','~',':','$','~',':','$','#','@','$','@','~',':','#'}; static int top=0; static int toup=0; public static char getChar() { return st[top++]; } public static void getInit() { top=0; }