International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 31 - Issue 1 |
Published: October 2011 |
Authors: Atul Chaturvedi, Varun Shukla |
![]() |
Atul Chaturvedi, Varun Shukla . Tripartite Key Agreement Protocol using Conjugacy Problem in Braid Groups. International Journal of Computer Applications. 31, 1 (October 2011), 1-4. DOI=10.5120/3786-5201
@article{ 10.5120/3786-5201, author = { Atul Chaturvedi,Varun Shukla }, title = { Tripartite Key Agreement Protocol using Conjugacy Problem in Braid Groups }, journal = { International Journal of Computer Applications }, year = { 2011 }, volume = { 31 }, number = { 1 }, pages = { 1-4 }, doi = { 10.5120/3786-5201 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2011 %A Atul Chaturvedi %A Varun Shukla %T Tripartite Key Agreement Protocol using Conjugacy Problem in Braid Groups%T %J International Journal of Computer Applications %V 31 %N 1 %P 1-4 %R 10.5120/3786-5201 %I Foundation of Computer Science (FCS), NY, USA
Braid groups were first introduced by Emil Artin in 1925. First cryptosystem, using Braid groups as a platform was discovered by Anshel et al in 2001. After the publication of this paper several cryptosystems on Braid groups had been designed. In this paper we have proposed a tripartite authenticated key agreement protocol using conjugacy problem which works in a braid group. We have proved that our protocol meet the security attributes under the assumption that the Conjugacy Search Problem (CSP) is hard in braid group.