Volume 2 - Issue 3
A key establishment protocol based on Clifford semigroup
Abstract
In this paper, the feasibility of making use of infinite non-abelian semigroups is explored instead of groups as a platform for key establishment protocol. An algebraic key establishment protocol presented by Iris Anshel is generalized. In the new protocol, semigroup is adopted instead of monoid. A key establishment protocol based on the difficulty of the multiple simultaneous conjugacy search problem (MSCSP) in Clifford semigroups is given as an illustration.
Paper Details
PaperID: 33746542443
Author's Name: Huang, H., Xiao, G.
Volume: Volume 2
Issues: Issue 3
Keywords: Clifford semigroup, Conjugacy search problem, Key establishment protocol, Public key cryptosystem
Year: 2005
Month: September
Pages: 439-444