IJPAM: Volume 16, No. 4 (2004)

TWO WAY AUTHENTICATION KEY
AGREEMENT BASED ON BRAID GROUPS

Denis Goh Chuan Hu$^1$, Azman Samsudin$^2$
$^{1,2}$School of Computer Science
University of Science at Malaysia
Penang, 11800, MALAYSIA
$^1$e-mail: denis@cs.usm.my
$^2$e-mail: azman@cs.usm.my


Abstract.Public Key Cryptosystem (PKC) is an algorithmic method used to transmit private data over an insecure channel in which both ends do not share a common key. The notable PKC algorithms include RSA, Diffe-Hellman and Elliptic Curve Cryptosystem. However, all these algorithms are based on the finite Abelian group theory. Lately, the braid groups theory has also been used in developing PKC. The braid groups theory is based on the concept of intertwining strands extended between two parallel planes and can be represented in terms of braid words. A classical problem that arose from this work is the word conjungacy problem. This paper presents a new authentication and key-exchange protocol suitable for authenticating users and exchanging keys over an insecure communication. This new protocol is based on braid groups. The main objective of this paper is to give the audience an alternative method in doing PKC and not just confine themselves to the Abelian group theory.

Received: September 10, 2004

AMS Subject Classification: 20F36

Key Words and Phrases: braid groups, key exchange, authentication problems, conjugacy problems

Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2004
Volume: 16
Issue: 4