Paper 2020/932
A Note on Authenticated Group Key Agreement Protocol Based on Twist Conjugacy Problem in Near – Rings
Atul Chaturvedi, Varun Shukla, and 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)
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint. MINOR revision.
- Keywords
- Data communicationKey agreementNear – ringTwisted Conjugacy Search Problem (TCSP)
- Contact author(s)
- atulibs @ gmail com
- History
- 2020-07-29: received
- Short URL
- https://ia.cr/2020/932
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2020/932,
author = {Atul Chaturvedi and Varun Shukla and Manoj K. Misra},
title = {A Note on Authenticated Group Key Agreement Protocol Based on Twist Conjugacy Problem in Near – Rings},
howpublished = {Cryptology ePrint Archive, Paper 2020/932},
year = {2020},
note = {\url{https://eprint.iacr.org/2020/932}},
url = {https://eprint.iacr.org/2020/932}
}
