A parallel key generation algorithm for efficient diffie-hellman key agreement

The kernel function of the Diffie-Hellman (DH) protocol is a modular exponentiation over finite field with high computational complexity. In this paper, we propose a novel key generation algorithm for DH agreement that derives computational efficiency from constructing a parallel architecture. Compared to the serial structure for traditional binary representation (BR) method, our algorithm is significantly more efficiency on key generation and suitable for hardware implementation in an ephemeral-static mode for DH agreement which is thought to be more secure (Rosorla, 1999)