EFFICIENT DIGITAL ENCRYPTION ALGORITHM BASED ON MATRIX SCRAMBLING TECHNIQUE
M. Kiran Kumar1, S. Mukthyar Azam1, Shaik Rasool2
1Dept. of Computer Science & Engg, R.V.R & J.C College of Engg, Guntur, India
1Dept. of Research & Development, Synfosys, Hyderabad, India
2Dept. of Computer Science & Engg, S.C.E.T., Hyderabad, India
ABSTRACT
This paper puts forward a safe mechanism of data transmission to tackle the security problem of information which is transmitted in Internet. We propose a new technique on matrix scrambling which is based on random function, shifting and reversing techniques of circular queue. We give statistical analysis, sequence random analysis, and sensitivity analysis to plaintext and key on the proposed scheme. The experimental results show that the new scheme has a very fast encryption speed and the key space is expanded and it can resist all kinds of cryptanalytic, statistical attacks, and especially, our new method can be also used to solve the problem that is easily exposed to chosen plaintext attack. We give our detailed report to this algorithm, and reveal the characteristic of this algorithm by utilizing an example.
KEYWORDS
Cipher text, Encryption, Decryption, Random Number Generator, Circular queue.
Original Source Link : http://airccse.org/journal/nsa/1010ijnsa03.pdf
No comments:
Post a Comment