Dynamic Multi-Key Choice Symmetric Key Exchange Algorithm for Secured Transaction
Mr. Anil Hingmire , Mr. Sundal Jain , Ms. Aakanksha Choudhary , Mr. Pritam Hazra
Abstract
With the ease that the Internet provides, now, it also, demands a higher security and a need of assurance that the confidential data remains intact till it reaches the other end. To fulfill this necessity, many algorithms and systems showed up-each with its own promises and drawbacks but they couldn’t withstand attacks like Brute Force and many others which were specially synthesized to crack these algorithms and fail such systems. In this paper, a new system, which ensures a secure transaction for all the scenarios, is discussed. The algorithm deals with keys which can be used for the future transactions and will be ensuring of secure transactions that the cryptanalyst won’t crack.
[2] International Journal of Innovative Research in Science, Engineering and Technology, Vol. 4, Issue 3, March 2015: A Comparative Study of Some Symmetric and Asymmetric Key Cryptography Algorithms, Nivedita Bisht, Sapna Singh.
[3] R. Rivest,A Shamir, L. Aldeman, "A Methoed for Obtaining DigitalSignatures and Public-key Cryptosystems," J. Communications of the ACM, 1978, 21(2): 120-126.
M. A. H. , M. S. J. , M. A. C. , M. P. H. ,
"Dynamic Multi-Key Choice Symmetric Key Exchange Algorithm for Secured Transaction", International Journal of Innovative Research in Engineering & Management (IJIREM), Vol-3, Issue-2, Page No-122-124, 2016. Available from:
Corresponding Author
Mr. Anil Hingmire
Department of Computer Engineering, Mumbai University, Mumbai, India