Cryptology ePrint Archive: Report 2020/932

A Note on Authenticated Group Key Agreement Protocol Based on Twist Conjugacy Problem in Near Rings

Atul Chaturvedi Varun Shukla Manoj K.Misra

Abstract: ABSTRACT In 2017, D. Ezhilmaran & V. Muthukumaran (E&M [1]) have proposed key agreement protocols based on twisted conjugacy search problem in Near ring and they have claimed that one can extend 3 party key agreement protocol (3PKAP) to any number of parties. Unfortunately their protocol is not an extension of 3PKAP and we present this weakness in this paper. We also show that their proposed 3PKAP is practically infeasible. Their protocol is not extendable to large number of parties like in banking system where number of parties is high. To overcome this problem we present an improved (or corrected) version of 3PKAP and for better understanding we extend it into 4PKAP with improvements in terms of number of passes, rounds, time complexity and run time.

KEYWORDS Data communication, Key agreement, Near ring, Twisted Conjugacy Search Problem (TCSP)

Category / Keywords: foundations / Data communication, Key agreement, Near ring, Twisted Conjugacy Search Problem (TCSP)

Date: received 29 Jul 2020

Contact author: atulibs at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20200729:190645 (All versions of this report)

Short URL: ia.cr/2020/932


[ Cryptology ePrint archive ]