MAT-V: A strong cryptography algorithm for stream cipher techniques
VANI .N
Rao Bahadur Y. Mahabaleswarappa Engineering College, Department of computer science, VTU University
Bellary, India
E-mail-id: [email protected] SRIDEVI MALIPATIL
Rao Bahadur Y. Mahabaleswarappa Engineering College, Department of computer science, VTU University
Bellary, India
E-mail-id: [email protected] CHETHANA .C
BMS Institute of Technology and Management, Department of computer science, VTU University,
Bangalore, India
E-mail-id: [email protected]
Abstract— To improve and increase greater security, efficiency, confidentiality for end user in stream cipher algorithms and also increases complexity for all types of attackers such as correlation attack and linear syndrome attack. MAT-V algorithm is asymmetric key cipher technique each character is encrypted with different private keys. So that increases complexity for attacker to identify original message sent by user. This algorithm provides confidentiality, authentication and data integrity and access control. Different keys are generated based on mathematical solutions of encryption keys and decryption keys. This algorithm reduces drawbacks of PKZIP, ORYX and SEAL drawbacks.
Keywords- LFSR, ORYX, SEAL, PKZIP
I. INTRODUCTION
Stream Cipher is a symmetric cipher which operates in time varying transformation on individual plaintext digit. Stream cipher is more faster and lower hardware complexity, LFSR (Linear Feedback shift register) is running key generator which ahs high linear complexity in generating keys. This a commonly used technique to produce pseudo-random sequence which can be used as a running key used as encryption for individual digit.
Correlation attack is a divide and conquer technique and it is cipher text only attack. Linear syndrome attack is an attack on LFSR based key stream generator. It is weak version of the fast correlation attack. Stream cipher algorithms have greater encryption technique for each character encryption technique is applied and difficult for hacker to decrypt data.
II. EXISTING SYSTEM
Existing algorithm has few complexities in hardware and software implementation and also has brute force attack, man-in-middle attack in RC4 algorithm. ORYX is stream cipher algorithm used to encrypt data sent over digital cellular phones. ORYX encryption algorithm used in second generation mobile communication offers a low level security. This is due to lack of public scrutiny of cryptographic algorithms. A Known plaintext attack is done on ORYX so it is insecure. The ORYX stream cipher that requires only 25-27 bytes of known plaintext and has time complexity of 216. SEAL (Software optimized encryption algorithm) stream cipher algorithm. It has correlation attack and correlation immunity. PKZIP cipher design is insecure and weak. This algorithm should not be used to protect password and valuable information. A known plaintext attack breaks cipher using 40 known plain text bytes with complexity 234. PKZIP cipher is weak and that should not be used to protect valuable information.RC4 is stream cipher algorithm used in WEP protocol to protect WIFI network. A full plaintext can be recovered using 230 sessions. If and only is single byte needs to be recovered about 224 session might be sufficient depending on the position of the byte in the plaintext.
III. PROPOSED SYSTEM
MAT-V algorithm is Asymmetric key cipher technique where each character is encrypted with private keys is a stream cipher algorithm character by character encryption.
Let us consider take first encryption technique for first character:-67
Fig. 1 MAT-V encryption and decryption technique
A B C
D E F
G H I
Fig 2: MAT-V Encryption technique for first character framing
Fig 3: MAT-V Encryption technique for second character framing
73 66 71
68 69 70 67 72 65
65 66
67 68 69 70 71 72 73
67 70 73 66 69 72
65 68 71
E2 E4
E6
IV. MATS-VALGORITHMS FOR STREAM CIPHER SECURITY
a) MATS-V Encryption Algorithms:
Input for encryption algorithm:-67
Step 1:- Apply first encryption algorithm X=67
E1 =Sin(X) --- (1)
Step 2:- Apply Second encryption algorithm
E2 = Sinh (PK1) --- (2)
Step 3:- Apply encryption key K1 for encryption algorithm
E3 = E2 * K1 --- (3)
Step 4:- Apply encryption key K2 for encryption algorithm
E4= E3 + K2 --- (4)
Step 5:- Apply encryption key K3 for encryption algorithm
E5 = E4 * K3 --- (5)
b) MATS- V Key Generation Encryption Algorithm:
Step 1:- Generation of first encryption key Random number generator generates key R1
K1 = Sin2R1 --- (6)
Step 2:- Generation of second encryption key
for ( i =1; i < = 9 ; i ++ ) {
temp = 0910 Sum = Sum + temp }
K2= Sum Step 3:- Generation of third encryption key
K3 = c) MATS-V Decryption Algorithm:
Step 1: Apply decryption algorithm with DK1
D2 = D1 % (DK1) --- (7)
Step 2: Apply decryption algorithm with DK2
D3= D2 – (DK2) --- (8) Step 3: Apply decryption algorithm with DK3
D4 = D3/ DK3 --- (9) Step 4: Apply first decryption algorithm
D5= sinh-1(D4) --- (10) Step 5: Apply second decryption algorithm
D6 = Sin-1(D5) --- (11) d) MATS-V Key Generation Decryption Algorithm:
Step 1:- Generation of first decryption key
DK1 = --- (12)
Step 2: Generation of second decryption key
for ( i =1; i < = 9 ; i ++ ) {
Temp = 0910 Sum = Sum + temp }
DK2= Sum Step 3: Generation of third decryption key
Dk3 = 2tanR1/1+tanR12 --- (13) Step 4: Generation of fourth decryption key
D4 = D3 / DK3 --- (14) D4= 1.056126247
Step 5: Generation of fifth decryption key
D5 = Sin-1h (D4) --- (15) D5 = 0.9205092735
Step 6: Generation of sixth decryption key
D6= Sin-1(D5) --- (16) D6 = 67.00
V. EXAMPLE FOR MATS-VALGORITHM
a) Example for MATS-V Encryption Algorithm:
Step 1: Apply first encryption algorithm X=67 E1 =Sin(X) = Sin (67) = 0.9205048535 Step 2:- Apply Second encryption algorithm E2 = Sinh (PK1) = 1.056119818
Step 3:- Apply encryption key K1 for encryption algorithm E3 = E2 * K1
E3 = 0.3612142488
Step 4:- Apply encryption key K2 for encryption algorithm E4= E3 + K2
E4 = 450.3612142
Step 5:- Apply encryption key K3 for encryption algorithm E5 = E4 * K3
E5 = 2.026982335* 1010 E5 is the cipher text for first character 67.
b) Example for MATS- V Key Generation Encryption Algorithm:
Step 1:- Generation of first encryption key Random number generator generates key R1 =10.
K1 = Sin2A= sin2 (10)
= 0.3420201433 Step 2:- Generation of second encryption key
for ( i =1; i < = 9 ; i ++ ) {
temp = 0910 09
( 1)
Sum = Sum + temp }
K2= Sum
Step 3:- Generation of third encryption key K3 =
K3= 45007924.11 c) Example for MATS-V Decryption Algorithm:
Step 1: Apply decryption algorithm with DK1
D2= 450.3612165 Step 2: Apply decryption algorithm with DK2 D3= D2 – (DK2)
D3 = 0.3612164502 Step 3: Apply decryption algorithm with DK3 D4 = D3/ DK3
D4 = 1.056126247 Step 4: Apply first decryption algorithm D5= sinh-1 (D4) D5 = 0.9205092735 Step 5: Apply second decryption algorithm
D6 = Sin-1 (D5) D6 = sin-1 (0.9205092735) D6 = 67.00
d) Example for MATS- V Key Generation Decryption Algorithm:
Step 1:- Generation of first decryption key
DK1 =
DK1= 45007923.89
Step 2: Generation of second decryption key for ( i =1; i < = 9 ; i ++ ) {
Temp = 0910 Sum = Sum + temp }
DK2= Sum
Sum= 450
Step 3: Generation of third decryption key Dk3 = 2tanR1/1+tanR12 Dk3= 0.3420201433
VI. FLOWCHART OF ENCRYPTION ALGORITHM
Fig 4: Flowchart for MAT-V Encryption algorithm
VII. RESULTS
Fig 5: Complexity for attacker to decrpt original message
Fig 6: Encrption time for MAT-V and other algorithms
Fig 7: Decryption time for MAT-V and other algorithms
Fig 8: Performance in terms of speed in MAT-V Encryption algorithm
VII. CONCLUSION AND FUTURE WORK
MAT-V is asymmetric key cipher technique which provides strong encryption and decryption algorithm where each character is encrypted with different private keys. This algorithm provides high level of security, efficiency and greater complexity for attacker to decrypt the original message sent by user, this algorithm provides confidentiality, authentication and data integrity and access control. Different keys are generated based on mathematical solutions of encryption keys and decryption keys. This algorithm reduces drawbacks of PKZIP, ORYX and SEAL drawbacks. The future work of MAT-V algorithm is used to enhance this algorithm for all types of applications such as android mobile applications, cloud security, Big data analysis and its security issues.
REFERENCES
[1] Joseph Bonneau. The science of guessing: Analyzing an anonymized corpus of 70 million passwords. In IEEE Symposium on Security and Privacy, SP 2012, 21-23 May 2012, San Francisco, California, USA, pages 538-552.IEEE Computer Society, 2012.
[2] J. Clerk Maxwell, A Treatise on Electricity and Magnetism, 3rd ed., vol. 2. Oxford: Clarendon, 1892, pp.68–73.
[3] MP. Rogaway and D. Coppersmith, "A Software-Optimized Encryption Algorithm", Proceedings of the 1993 Cambridge Security Workshop, Springer-Verlag, 1994.
[4] B. Schneier, Applied Cryptography, Second Edition, John Wiley & Sons, 1996.
[5] S. Vaudenay, "Statistical Cryptanalysis of Block Ciphers - X 2 Cryptanalysis', 1995.
[6] J. Bass, Elements de Calcul des Probabilit~s, 3 ~ @dition, Masson Et Cie, 1974.
[7] E. Dawson and L. Nielsen. Automated cryptanalysis of XOR plaintext strings. Cryptologia, volume XX Number 2, pages 165{181.
April 1996.
[8] D. Wagner, B. Schneier and J. Kelsey. Cryptanalysis of the cellular message encryption algorithm. Advances in Cryptology - CRYPTO'97, volume 1294 of Lecture Notes in Computer Science, pages 526{537. Springer Verlag, 1997.
MAT--V
SEAL
PKZIP
ORYX
