Sciweavers

IJNSEC
2008

An Authenticated Key Agreement Protocol Using Conjugacy Problem in Braid Groups

13 years 10 months ago
An Authenticated Key Agreement Protocol Using Conjugacy Problem in Braid Groups
In this paper we propose an authenticated key agreement, which works in a braid group. We prove that our protocol meet the security attributes under the assumption that the Conjugacy Search Problem (CSP) is hard in braid group.
Atul Chaturvedi, Sunder Lal
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2008
Where IJNSEC
Authors Atul Chaturvedi, Sunder Lal
Comments (0)