Elliptic Curve Diffie Hellman technique extended for multiple two party keys at a time
In recent years elliptic curve cryptography (ECC) is emerging as an alternative to traditional public key cryptosystems(DSA, RSA, AES, etc).ECC offers equivalent security with smaller key sizes resulting in faster computations, lower power consumption, as well as memory and bandwidth saving. This work presents an Extension of Elliptic curve Diffie Hellman technique to generate multiple shared keys at a time with reduced Key exchange operations (KEO), for increasing security and widening of applicability. A comparative study between proposed protocol and other crypto systems was made and satisfactory results have been obtained. 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.
Keywords: Diffie Hellman, elliptic curves, multiple shared keys, discrete log problem
Download Full-Text
