Elementary Analysis of the Communication Complexity of Divide-and-Conquer Diffie-Hellman Key Agreement Protocol

We present a rigorous elementary analysis of the communication complexity Divide-and-Conquer Diffie-Hellman Key Agreement Protocol (DC-DHKA). The is conducted by first determining number transmissions in DC-DHKA and then comparing resulting this protocol with other variants key agreement protocols that utilize regular key, namely ING, GDH.1, GDH.2, GDH.3 protocols. mathematical numerical analyses show total bits transmitted always fewer than those GDH.2 for group N >= 19 participants. In addition, we also prove required entire messages’ participants uses multiplicative Fq* log2(q) 2^(log2(N)) (log2(N) + 1) - 2.