A Parallel Key Generation Algorithm for Efficient Diffie-Hellman Key Agreement

Author

Chen, Yun ; Chen, Xin ; Mu, Yi

Author_Institution

Chengdu Univ. of Inf. Technol.

Volume

2

fYear

2006

fDate

3-6 Nov. 2006

Firstpage

1393

Lastpage

1395

Abstract

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)

Keywords

computational complexity; cryptographic protocols; parallel algorithms; Diffie-Hellman key agreement; Diffie-Hellman protocol; computational complexity; ephemeral-static mode; finite field; modular exponentiation; parallel architecture; parallel key generation; Computational complexity; Computational efficiency; Concurrent computing; DH-HEMTs; Galois fields; Information technology; Kernel; Parallel architectures; Protocols; Public key;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Intelligence and Security, 2006 International Conference on

Conference_Location

Guangzhou

Print_ISBN

1-4244-0605-6

Electronic_ISBN

1-4244-0605-6

Type

conf

DOI

10.1109/ICCIAS.2006.295289

Filename

4076195