<?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-2497</article-id>
      <title-group>
        <article-title>Analyzing the performance of wireless sensor networks using polynomial cryptography methods</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Bhattacharya</surname>
            <given-names>Saurabh</given-names>
          </name>
          <aff>School of Computer Science &amp; Engineering, Galgotias University, Greater Noida, Uttar Pradesh, 203201, India</aff>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Indise</surname>
            <given-names>Leena</given-names>
          </name>
          <aff>Symbiosis Law School, Symbiosis Centre for Advanced Legal Studies and Research (SCALSAR), Symbiosis International (Deemed University), Pune, Maharashtra, 411014, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Pandey</surname>
            <given-names>Nisha</given-names>
          </name>
          <aff>Department of Computer Science &amp; Engineering, Noida International University, Greater Noida, Uttar Pradesh, 203201, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Nanche</surname>
            <given-names>Bhushan Marutirao</given-names>
          </name>
          <aff>Department of Information Technology, Akurdi, D Y Patil College of Engineering, Pune, Maharashtra, 411044, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Ramakrishna</surname>
            <given-names>S.</given-names>
          </name>
          <aff>Department of Computer Science and Engineering (Data Science), KKR and KSR Institute of Technology and Sciences, Guntur, Andhra Pradesh, 522017, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Sethi</surname>
            <given-names>Gaurav</given-names>
          </name>
          <aff>School of Electronics &amp; Electrical Engineering, Lovely Professional University, Phagwara, Punjab, 144411, India</aff>
        </contrib>
      </contrib-group>
      <volume>29</volume>
      <issue>2-A</issue>
      <fpage>563</fpage>
      <lpage>570</lpage>
      <pub-date date-type="pub">
        <day>31</day>
        <month>12</month>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>Wireless Sensor Networks (WSNs) are used in environmental monitoring, industry automation, and military surveillance. However, their limited power, memory, and computer capabilities make personal communication difficult. This research examines how successfully WSNs protect data using polynomial cryptography without affecting device performance. The suggested authentication and encryption mechanism uses polynomials. Polynomial key settlement and polynomial hash-based message verification enable this.  Modular algebra and finite topic algebra allow sensor nodes to be computed with little power. Network durability, packet transit ratio (PDR), power usage, and encryption time are performance indicators.  MATLAB simulations show that polynomial cryptography reduces laptop work and increases node lifespan. They safeguard against replay, node capture, and man-in-the-middle cryptographic attacks.  Compared to lightweight cryptographic techniques, the polynomial methodology encrypts data 15–20% faster and saves 30% more energy. This might improve energy-efficient and safe wireless communication systems.</p>
      </abstract>
      <kwd-group>
        <kwd>Wireless sensor networks (WSNs)</kwd>
        <kwd>Polynomial cryptography</kwd>
        <kwd>Lightweight security</kwd>
        <kwd>Modular arithmetic</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>
