Open AccessElementary Algorithms Analysis of Megrelishvili Protocol
Author(s) -
Muhammad Arzaki
Publication year - 2016
Publication title -
indonesian journal on computing
Language(s) - English
Resource type - Journals
eISSN - 2460-9234
pISSN - 2460-9056
DOI - 10.21108/indojc.2016.1.1.52
Subject(s) - protocol (science) , key exchange , computer science , public key cryptography , computation , algorithm , key (lock) , cryptographic protocol , diffie–hellman key exchange , elliptic curve , theoretical computer science , mathematics , cryptography , computer security , encryption , medicine , alternative medicine , pathology , mathematical analysis
This article presents an investigation of asymptotic time complexities of several algorithms related to Megrelishvili protocol. The analysis are carried out for the private keys computations and public exchange of values, public key constructions, as well as an elementary exhaustive search attack algorithm. We show that the complexities of these algorithms are higher than the complexities of elementary algorithms involved in the conventional Diffie - Hellman protocol (DHP) or its variant on elliptic curves (ECDHP). This condition also implies that Megrelishvili protocol is more secure than DHP and ECDHP against exhaustive search attack.