<?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-2201</article-id>
      <title-group>
        <article-title>Encryption and decryption scheme through signed Cayley graph</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Wardak</surname>
            <given-names>Obaidullah</given-names>
          </name>
          <aff>Department of Mathematics, South Asian University, New Delhi, Delhi, 110068, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Kumar</surname>
            <given-names>Sandeep</given-names>
          </name>
          <aff>Department of Mathematics, South Asian University, New Delhi, Delhi, 110068, India</aff>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Sinha</surname>
            <given-names>Deepa</given-names>
          </name>
          <aff>Department of Mathematics, South Asian University, New Delhi, Delhi, 110068, India</aff>
        </contrib>
      </contrib-group>
      <volume>28</volume>
      <issue>7</issue>
      <fpage>2811</fpage>
      <lpage>2825</lpage>
      <pub-date date-type="pub">
        <day>20</day>
        <month>02</month>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>The encryption and decryption of sensitive information have become increasingly important in today’s digital age. In this paper, we explore the innovative application of signed Cayley graphs for achieving enhanced security in data transmission. In the realm of communication, where information exchange is pervasive, the graph itself serves as the message, with its vertices, edges, and edge signatures containing the concealed information. This paper presents the development of an encryption and decryption scheme that utilizes a signed Cayley graph, along with a private (symmetric) key, to securely encrypt and decrypt the edges of the graph.</p>
      </abstract>
      <kwd-group>
        <kwd>Signed cayley graph</kwd>
        <kwd>Encryption</kwd>
        <kwd>Decryption</kwd>
        <kwd>Algorithm</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>
