Extended Diffie-Hellman Technique to Generate Multiple Shared Keys at a Time with Reduced KEOs and its Polynomial Time Complexity
Recently Biswas[1] extended Diffie-Hellman technique to generate multiple two-person-shared keys by exchange of two public keys. In this paper, we further generalize the Diffie-Hellman technique to generate multiple two-person-shared keys by exchange of any number of public keys and study its Polynomial Time Complexity, Security etc. Also, an upper bound for the number of shared keys in terms of the number of exchanged keys and for a given number of shared keys, the minimum required number of keys to be exchanged, were arrived at. Lastly, a comparative study between the proposed technique and the Diffie-Hellman technique repeated m-times is made.
Keywords: Diffie-Hellman technique, DDH problem, multiple shared keys, key exchange operations, secure data transmission
Download Full-Text
