<?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-2376</article-id>
      <title-group>
        <article-title>Implementation results on the integer Fibonacci matrix size 2×2 for key exchanging scheme</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Yahea</surname>
            <given-names>Abdalgabar K.</given-names>
          </name>
          <aff>Department of Mathematics, College of Computer Science and Mathematics, Tikrit University, Tikrit, Tikrit</aff>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Ajeena</surname>
            <given-names>Ruma Kareem K.</given-names>
          </name>
          <aff>Department of Computer Science, College of Education for Pure Science (Ibn Al-Haitham), University of Baghdad, Baghdad, Iraq</aff>
          <aff>Scientists Foundation for Development, NGO Directorate, General Secretariat of the Council of Ministers, Baghdad, Iraq</aff>
        </contrib>
      </contrib-group>
      <volume>29</volume>
      <issue>5</issue>
      <fpage>1965</fpage>
      <lpage>1970</lpage>
      <pub-date date-type="pub">
        <day>22</day>
        <month>05</month>
        <year>2026</year>
      </pub-date>
      <abstract>
        <p>In several encryption algorithms, the key exchange scheme (KES) type: Diffie-Hellman is used as a fundamental tool. In this paper, a new KES model has been proposed as an alternative contribution for using the matrix of Fibonacci numbers (IFM2×2). On the proposed model, the private keys are created as the IFMs2×2 through selecting the Fibonacci numbers (FNs) randomly over Fp, where p is a prime. The power IFMs2×2 from left (right) side is calculated (LPIFM2×2(RPIFM2×2)). These matrices are also used to compute public keys. A new algorithm of the proposed scheme, namely IFM2×2-KES, is presented in this work. New results are displayed for small parameter values, implemented in Python. The difficult computations of LPIFM2×2 and RPIFM2×2 simultaneously determine the security of the proposed algorithm. The proposed IFM2×2-KES is considered a bright point for the communication scheme.</p>
      </abstract>
      <kwd-group>
        <kwd>Cryptography</kwd>
        <kwd>KES</kwd>
        <kwd>Linear algebra</kwd>
        <kwd>IFM2×2</kwd>
        <kwd>RPIFM2×2</kwd>
        <kwd>Fibonacci numbers</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>
