论文信息 - An Authenticated Key Agreement Protocol Using Conjugacy Problem in Braid Groups

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

[1] Alfred Menezes,et al. Key Agreement Protocols and Their Security Analysis , 1997, IMACC.

[2] V B Styšnev. THE EXTRACTION OF A ROOT IN A BRAID GROUP , 1979 .

[3] J. Birman. Braids, Links, and Mapping Class Groups. , 1975 .

[4] E. Artin. The theory of braids. , 1950, American scientist.

[5] Jung Hee Cheon,et al. New Public-Key Cryptosystem Using Braid Groups , 2000, CRYPTO.

[6] James Hughes,et al. A Linear Algebraic Attack on the AAFG1 Braid Group Cryptosystem , 2002, ACISP.

[7] D. Goldfeld,et al. An algebraic method for public-key cryptography , 1999 .

[8] Mihir Bellare,et al. Entity Authentication and Key Distribution , 1993, CRYPTO.

[9] Patrick Dehornoy,et al. Entity authentication schemes using braid word reduction , 2006, Discret. Appl. Math..

[10] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[11] Jang-Won Lee,et al. New Signature Scheme Using Conjugacy Problem , 2002, IACR Cryptol. ePrint Arch..

[12] F. A. Garside,et al. THE BRAID GROUP AND OTHER GROUPS , 1969 .

[13] Iris Anshel,et al. New Key Agreement Protocols in Braid Group Cryptography , 2001, CT-RSA.