CC BY-NC-ND
0Available online at www.sciencedirect.com
SciVerse ScienceDirect Procedía
Engineering
Procedía Engineering 30 (2012) 170 - 173 -
www.elsevier.com/Iocate/procedia
International Conference on Communication Technology and System Design 2011
A Cryptosystem Design with Recursive Key Generation Techniques
S.G.Srikantaswamy1, H.D.Phaneendra2, 1*
1National Institute of Engineering, Mysore, Karnataka, India 2Department of Computer Science and Engineering, NIE, Mysore, Karnataka, India
Abstract
Communication is a basic process of exchanging information. It involves sender, receiver and the channel. Information security is a very important aspect now a day. The introduction of internet and distributed system made the information security issue more challenging and complex. Cryptography plays a crucial role in providing security to data transmitted over the internetwork. Encryption is the most widely used technique used to scramble the data that is being transmitted over the network from sender to a receiver. The encryption algorithms are available practically and provide the security for user data and information.This paper presents an advanced encryption technique which combines the features of substitution and transposition. Five different key values being used in this algorithms and each key value is used to substitute the corresponding plaintext characters in association with addition operation. Each key value is twice as that of the previous one. The basic key value is a fixed one defined by the user. The transposition technique is employed by left shifting each bit of the data. The shifted data is complemented to alter the each bit of the cipher text that is being generated. The effort of the algorithm is to make the cryptanalysis difficult and to make the algorithm stronger.
© 2011 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of ICCTSD 2011
Keywords: Cryptosystem;, Information Security; Plaintext;Cipher text, Encryption; Decryption, Key; Cipher, Substitution; Transposition.
1. Introduction
Encryption is a technique of scrambling the original data to be transmitted. Decryption is a process of converting the scrambled data to original format. The original data is referred as plaintext and the scrambled data is called cipher text. The nonlinearity property play a important role in block cipher design[1]. The role of key is very important in encrypting and decrypting the data to be transmitted [2]. Many encryption and decryption algorithms are widely available and being used for encrypting and decrypting the data [6, 7]. Many encryption algorithm incorporates both substitution and transposition techniques [3, 4, 5].Substitution cipher involves the replacing one or more characters in a message with one or more other entities may be other characters, symbols and numbers. There are several types of substitution ciphers available in the field of network security [6].Mono alphabetic substitution involves replacing each character or letter in the given message with another character of the alphabet. Polyalphabetic substitution involves the following features:
• A set of related monoalphabetic substitution rules is used.
A key determines which particular rule is chosen for a given transformation.
The best known such algorithm is referred to as the vigenere cipher [6]. Here, an encryption algorithm which incorporates the techniques of both substitution and transposition technique with effective key generation technique is proposed. To encrypt a message, a key value K is assumed. The first character of the message is added with the key value. The resultant value is then right shifted once. The right shifted value is then complemented. The resultant complemented value is the
* S.G.Srikantaswamy, Mobile : 09900898748, Email : sg_srikantaswamy@yahoo.com
1877-7058 © 2011 Published by Elsevier Ltd. doi:10.1016/j.proeng.2012.01.848
final ciphertext value for the corresponding plaintext character. The second character is encrypted in the same manner but with a key value K, where the present value of the Key value is equal to double the value of the key value used in the previous step. The third character is complemented using the key value K[2]=K[1]+K[1]. The fourth character by K[3]=K[2]+K[2], and fifth by K[4]=K[3]+K[3]. The sixth character by K[5]=K[4]+K[4], Seventh character by K[6]=K[5]+K[5]. and so on, with the value of Ki, where 1 < i < n.
The organization of the paper is gives as follows: Section 2 provides the complete encryption process details. Section 3 gives encryption algorithm details. Section 4 gives encryption and decryption results. Section 5 provides the features of the proposed scheme and Section 6 provides conclusions drawn from the analysis carried out on the above desired encryption and decryption algorithm. Section 7 contains references.
2. Encryption process
Consider a plaintext message say "ENCRYPTION". Let the key be K. Now the different versions of key values are derived using recursion method. Consider the first character of the plaintext message P[0]. Let the key value used to substitute the first character be K[0] , initial value to be assumed. For the subsequent plaintext characters P[i], the key value to be used is K[i], where 1 < i < n . The first plaintext character is added with key value K[0]. The initial key value is selected by the communicating entities.The key value is added to plaintext character.The resultant value is right shifted once .The shifted value of the plaintext is complemented to obtain the final ciphertext value for corresponding value of the plaintext .Now for the Next plaintext character say P[1], the key value used will be K[1]=K[0]+K[0].For the Subsequent plaintext characters, the key value is used K[i] = K[i-1]+K[i]-1. The above procedure is repeated to obtain C2. Similarly to obtain C3 from P3, the key value used will be K[3] = K[2]+K[2], for C4, key K[4] = K[3]+K[3], and finally for Ci,key K[i] = K[i-1]+K[i-1].
3. Encryption algorithm
Step 1: Start
Step 2: Input the plaintext message Pi, 1 < i < Step 3: Declare the key value K[0]. Step 4: Generate different key values Ki, 1 < i K[i]=K[i-1]+K[i-1]; K[0]= say 25; K[1]=K[0]+K[0]; K[2]=K[1]+K[1]; Etc...
Step 5: Add corresponding Key to plaintext Step 6: Right shift the result of step 5 once Step 7: Complement the result of step step 6 Step 8: Transmit the Ciphertext
4. Encryption and decryption results
4.1 Encryption
P A.V K C1 C2 C
E 69 25 94 47 65488
N 78 50 128 64 65471
C 67 100 167 83 65452
R 82 200 282 141 65394
Y 89 400 489 244 65291
P 80 800 880 440 65095
T 84 1600 1684 842 64693
I 73 3200 3273 1636 63899
O 79 6400 6479 3239 62296
N 78 12800 12878 6039 59496
P=Plaintext, A.V= Ascii decimal eqt.of P. K=Key Value, C1=P+K, C2= C1 Right shifted once, C= Ciphertext = One's Complement of C2
4.2 Decryption
C P3 P2 P1 P
65488 47 94 69 E
65471 64 128 78 N
65452 83 167 67 C
65394 141 282 82 R
65291 244 489 89 Y
65095 440 880 80 P
64693 842 1684 84 T
63899 1636 3273 73 I
62296 3239 6479 79 O
59496 6039 12878 78 N
C=Ascii.eqt.of ciphertext P3=One's complement of C P2=P3 left shifted once P1=P2-K
P= Original transmitted Plaintext character
5. Features of the proposed scheme
i. More security
ii. Simple coding
iii. Good Encryption Speed
iv. Easy to Analyze
v. Fast Response.
6. Conclusion
The Secured communication is a very important aspect of data communication. The securing data is more important in data communications over internet-works. Active attacks involve both modification and fabrication of messages. The goal of the encryption algorithm designing is to frustrate the hackers and makes the cryptanalysis difficult. The key value play more important role in encryption process. The processing speed,coding factors also plays a very important role. Using different key values for encrypting consecutive characters of plaintext hides the relationship between the ciphertext and plaintext. Altering each value of the ciphertext generated to get the final ciphertext make the cryptanalysis still more complex. The algorithm provides appreciable data security and requires minimum coding and involves less processing delay. The key length can be extended to improve security but it reduces the speed. The working of the algorithm can be demonstrated for any length of data.
7. References
[1] Orr Dunkelman and Nathan keller, "A New criterion for Nonlinearity of Block Ciphers", IEEE Transactions on information theory, November 2007, Vol-53,No.ll.
[2] SUN jing, YANG Jing-yu, Fu De-sheng, "Research on the Security of Key Generator in Stream Ciphers", Dept. Computer Science and Technology, Nanjing University of Science & Technology, Nanjing Jiangsu 210016, China, Dept. of Computer & Software, Nanjing University of Information Science & Technology, Nanjing JiangSu, 210044, china,-The First International Conference on Information Science and Engineering.
[3] R. Venkateswaram, Research Scholar - Ph. D , Karpagam Academy of Higher Education , Karpagam University, Coimbatore, Tamilnadu, India, Dr.V.Sundaram, Director Computer applications, Karpagam College of Engineering, (Affiliated to AnnaUniversity), Coimbatore, Tamilnadu, India , "Information Security: Text Encryption and Decryption with Poly Substitution method and combining features of cryptography International Journal of Computer Applications, June 2010, (8887) Volume 3 - No. 7.
[4] V. Umakanta Sastry, N. Ravi Shankar, and S. Durga Bhavani, Director, SCSI, Dean CR & DI, Sreenidhi Institute of Science and Technology, Hyderabad, India, CSE Department, SNIST, Hyderabad, India, SIT, JNT University, Hyderabad, India, "A modified Hill cipher Involving Interweaving and Iteration", International Journal of Network Security, July 2010, Volume 11, No. 1, P P 11- 16.
[5] Dr. V. U. K. Sastry, Prof. D. S. R. Murthy, Dr. S. Durga Bhavani, "A block cipher having a key on one side of plaintext Matrix and its Inverse on the other side", International Journal of Computer Theory and Engineering, October 2010, Volume 2, No. 5, 1793 - 8201.
[6] "Cryptography and Network Security Principles and Practices", Third Edition - William Stallings.
[7] BRUE SCHNEIER, "Applied Cryptography,Protocols, Algorithms and Source Coding", Second Edition, John Wiley & Sons, Inc
[8] Jonathan Katz,Yehuda Lindell,Chapman & Hall / CRC,Taylor R Francis Group, "Introduction to Modern Cryptography".
