Three Party Key Sharing Protocol Using Polynomial Rings

Abstract

All of us know that authentication and key agreement are the two cryptographic services very important for data communication. People use online methods for information exchange using various wireless communication channels. Intruders want to steal sensitive useful information and they use different cryptanalysis ways for that. Quantum computing methods also produces danger for all the existing protocols and algorithms. So at this point of time, it is essential that researchers find new and innovative protocols for data communication in order to surprise intruders. In this paper we present three party key sharing protocol and its correctness involving polynomial rings.