An Authenticated Key Agreement Protocol Using Artin’s Braid Group
DOI:
https://doi.org/10.26438/ijcse/v5i12.233236Keywords:
Braid Decomposition Problem(BDP), Conjugacy Search Problem(CSP), Key Agreement, Non Commutative Groups, Trusted Third Party (TTP), Wireless CommunicationAbstract
This paper proposes a new and efficient key agreement protocol where trusted third party (TTP) is involved. There are various available schemes which are based on number theoretic, elliptic curves etc. Due to the availability of modern computers, these schemes are vulnerable to man in the middle attack (MITM). So there is a requirement of new technique for key agreement which surprises the intruders and enhances the security of communication system. Our proposed protocol utilizes the property of a non commutative group. We have given the security proof of our protocol keeping the fact in mind that decomposition and conjugacy search problem are hard in a group which is non commutative.
References
I.Anshel, M.Anshel, B.Fisher, D.Goldfeld, New key agreement protocols in braid group cryptography, Proc.of CT-RSA , LNCS (2020), Springer-Verlag, 2001, 1-15.
I. Anshel, M. Anshel , D. Goldfeld, An algebraic method of public-key cryptography, Math. research letters, 6 ,1999, 287-291.
K.H.Ko, D.H.Choi, M.S.Cho, J.W.Lee, New signature scheme using conjugacy problem, e print archive, http://eprint.iacr.org/2002/168.
K.H. Ko, S.J. Lee, J.H. Cheon, J.W. Han, J.S. Kang, C Park, New public-key cryptosystem using braid groups, Advances in cryptology, proceeding of crypto - 2000, LNCS (1880) , Springer Verlag ,2000, 166-183.
G. Kumar , H. Saini , Novel non commutative cryptography scheme using extra special group, Security and communication networks, 2017.
Y. K. Peker, A new key agreement scheme based on the triple decomposition problem, International journal of network security (6), 2014, 426 – 436.
H.Sibert, P.Dehornoy, M.Girault, Entity authentication schemes using braid word reduction, in International workshop on coding and cryptography (WCC) 2003, Discrete applied mathematics, 154-2, Elsevier, 2006, 420 – 436. (http://eprint.iacr.org/2002/187).
V.Halava, T.Harju, R.Niskanen, I.Potapov, Weighted automata on infinite words in the context of attacker – defender games, Information and computation , Elsevier, 255 (1), 2017, 27 – 44.
E. Artin, Theory of braids, Annals of math.48 (1947),101-126.
W. Diffie, & M.Hellman, New directions in cryptography, IEEE trans. inform. theory, 22 (6),1976,644-654.
J.Birman, Braids, links, and mapping class groups, Annals of math. studies, Princeton Univ. Press ,1975.
F.A. Garside, The braid group and other groups, Quart. J. math. oxford 20-78 ,1969, 235-254.
A.Chaturvedi, M.K.Misra,S.P.Tripathi,V.Shukla,N. Srivastava A New Key Agreement Protocol Using BDP and CSP in Non Commutative Groups, Int. J. Advanced Networking and Applications. 9(3) ,2017,3428-3431.
A.Chaturvedi,V.Shukla,N.Srivastava A secure wireless peer to peer authentication protocol using triple decomposition problem, Asian journal of mathematics and computer research.22(2) 2017,63-69.
L.Law, A.Menezes, M.Qu, J.Solinas, S.Vanstone, An efficient protocol for authenticated key agreement, Design, codes and cryptography, 28 (2), 2003, 119-134.
M.Bellare, P.Rogaway, Entity authentication and key distribution, Proceeding of CRYPTO’93, Santa Barbara, USA,1994, 341-358.
A.O. Baalghusun, O.F. Abusalem, Z. A. A. Abbas, J. P. Kar, Authenticated key agreement protocols: A comparative study, Journal of information security, (6), 2015, 51 – 58.
A.Menezes, M.Qu, S.Vanstone, Key agreement and the need for authentication, in proceedings of PKS’95, 1995, 34 – 42.
S. B. Wilson, D.Johnson, A.Menezes, Key agreement protocol and their security analysis, Proceedings of sixth IMA international conference on cryptography and coding, Cirencester, UK, 1997, 30 - 45.
M.V.Bhaskar,G.A.Ramchandra,Y.Deepika,Multipath optimized link state protocol(OLSR) with security for moblle ad-hoc networks .International journal of computer science and engineering,5(11),2017,182-186.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
