Common Contracts

1 similar Tripartite Key Agreement Protocol contracts

Tripartite Key Agreement Protocol using Conjugacy Problem in Braid Groups
Tripartite Key Agreement Protocol • December 26th, 2011

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 Braid Decomposition Problem (BDP) and the Conjugacy Search Problem (CSP) are hard in braid group.

AutoNDA by SimpleDocs
Draft better contracts in just 5 minutes Get the weekly Law Insider newsletter packed with expert videos, webinars, ebooks, and more!