<?xml version="1.0" encoding="UTF-8"?>
<article article-type="Research Article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher">journal-of-discrete-mathematical-sciences-and-cryptography</journal-id>
      <journal-title-group>
        <journal-title>Journal of Discrete Mathematical Sciences and Cryptography</journal-title>
      </journal-title-group>
      <issn publication-format="electronic">2169-0065</issn>
      <issn publication-format="print">0972-0529</issn>
      <publisher>
        <publisher-name>Taru Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.47974/JDMSC-1615</article-id>
      <title-group>
        <article-title>The optimized Diffie-Hellman key exchange using the graphical method</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Aljader</surname>
            <given-names>Huda Kadhim M.</given-names>
          </name>
          <aff>Department of Mathematics, Education College for Pure Sciences, University of Babylon, Babil, Iraq</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Ajeena</surname>
            <given-names>Ruma Kareem K.</given-names>
          </name>
          <aff>Department of Mathematics, Education College for Pure Sciences, University of Babylon, Babil, Iraq</aff>
        </contrib>
      </contrib-group>
      <volume>26</volume>
      <issue>6</issue>
      <fpage>1691</fpage>
      <lpage>1697</lpage>
      <pub-date date-type="pub">
        <day>01</day>
        <month>06</month>
        <year>2023</year>
      </pub-date>
      <abstract>
        <p>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.</p>
      </abstract>
      <kwd-group>
        <kwd>Cryptography</kwd>
        <kwd>Optimization problem</kwd>
        <kwd>Graphical method</kwd>
        <kwd>ODHKE</kwd>
        <kwd>ODLFs</kwd>
        <kwd>Security</kwd>
      </kwd-group>
      <custom-meta-group>
        <custom-meta>
          <meta-name>access</meta-name>
          <meta-value>open</meta-value>
        </custom-meta>
        <custom-meta>
          <meta-name>retracted</meta-name>
          <meta-value>no</meta-value>
        </custom-meta>
      </custom-meta-group>
    </article-meta>
  </front>
</article>
