Cryptographic computation of private shared key based mutual authentication protocol: Simulation and modeling over wireless networks

Protecting communication among sender and receiver over a public channel network requires for the most part an important security mechanism to provide two parties with the property that they can authenticate each other´s identification parameters which are indispensable to construct a common private key. Based on the decisional Diffie-Hellman assumptions, this paper presents a cryptographic calculation of the shared secret key enabling mutual authentication and confidentiality services over public, insecure networks. This protocol is efficient than “classical” Diffe-Hellman key exchange which provides no authentication at all. To attain this, we first model the scheme with mathematical concept for exponential calculation using entity parameters and finally we simulate the work by CrypTool 2.0 to verify the feasibility and shared secret value sameness. The resultant shows that the protocol is practical and provably-secure in regards with standard cryptographic assumptions. Moreover, the value that would be exchanged can be used as secret key for further encrypted symmetric communication. The proposed method is awfully straightforward, valuable, and resilient to know attacks.