The optimized Diffie-Hellman key exchange using the graphical method
Huda Kadhim M. Aljader, Ruma Kareem K. Ajeena
Abstract
Huda Kadhim M. Aljader, Ruma Kareem K. Ajeena
Abstract
In this paper, we describe a new contribution that uses the optimization problem to create a new version of the Diffie-Hellman key exchange (DHKE). The proposed version depended on the optimized discrete logarithm functions (ODLFs) that are given as a new definition in this work. A graphical method considers a fundamental tool to compute a shared secret key (SSK) in the proposed optimized Diffie-Hellman key exchange (ODHKE). The ODHKE is a more secure protocol for computing the SSK in comparison with the original DHKE.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we describe a new contribution that uses the optimization problem to create a new version of the Diffie-Hellman key exchange (DHKE). The proposed version depended on the optimized discrete logarithm functions (ODLFs) that are given as a new definition in this work. A graphical method considers a fundamental tool to compute a shared secret key (SSK) in the proposed optimized Diffie-Hellman key exchange (ODHKE). The ODHKE is a more secure protocol for computing the SSK in comparison with the original DHKE.
Key concepts: Diffie–Hellman key exchange, Key exchange, Key (lock), Computer science, Discrete logarithm, Theoretical computer science, Logarithm, Public-key cryptography