<?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-3060</article-id>
      <title-group>
        <article-title>Efficient scalar multiplication algorithms on elliptic curves over prime fields for resource-constrained cryptographic devices</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Reddy</surname>
            <given-names>M. Sreenivasa</given-names>
          </name>
          <aff>Department of Mechanical Engineering, Aditya University, Surampalem, Andhra Pradesh, 533437, India</aff>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Hasan</surname>
            <given-names>Fazil</given-names>
          </name>
          <aff>Department of Agriculture, Noida International University, Greater Noida, Uttar Pradesh, 203201, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Gupta</surname>
            <given-names>Shivangi</given-names>
          </name>
          <aff>Quantum University Research Center, Quantum University, Roorkee, Uttarakhand, 247667, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname> Chaudhary</surname>
            <given-names>Shivam P.</given-names>
          </name>
          <aff>Faculty of Engineering, Gokul Global University, Sidhpur, Gujarat, 384151, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Pawar</surname>
            <given-names>Manisha Sagar</given-names>
          </name>
          <aff>Department of Engineering Science and Humanities, Vishwakarma Institute of Technology, Pune, Maharashtra, 411037, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Islam</surname>
            <given-names>Shaziya</given-names>
          </name>
          <aff>Department of Computer Science &amp; Engineering, Rungta College of Engineering &amp; Technology, Rungta International Skills University, Bhilai, Chhattisgarh, 490024, India</aff>
        </contrib>
      </contrib-group>
      <volume>29</volume>
      <issue>10-B</issue>
      <fpage>4397</fpage>
      <lpage>4406</lpage>
      <pub-date date-type="pub">
        <day>31</day>
        <month>10</month>
        <year>2026</year>
      </pub-date>
      <abstract>
        <p>Although Elliptic Curve Cryptography (ECC) over prime fields is computationally efficient in many cryptographic operations, scalar multiplication remains a computational bottleneck, particularly in resource-constrained devices such as IoT nodes and embedded systems. The paper addresses the issue of decreasing the computation time, memory and energy usage and maintaining the cryptographic security. It is proposed to use a hybrid optimization system that is based on windowed techniques, Montgomery ladder to perform periodically and parallelized arithmetical operations. Its algorithm allows it to use optimized modular arithmetic and reduced point operations to achieve maximum performance. Experimental results indicate that the time of scalar multiplication is decreased by 34.8 percent, additions of points are decreased by 28.5 percent, and the amount of energy used is lowered by 22.7 percent when traditional methods of double-and-add are used. The proposed solution is resistant to side-channel attacks, in addition to being more efficient. The results indicate that it can be used in real-time embedded system cryptography that is secure and low-power.</p>
      </abstract>
      <kwd-group>
        <kwd>Elliptic curve cryptography</kwd>
        <kwd>Scalar multiplication</kwd>
        <kwd>Prime fields</kwd>
        <kwd>Montgomery ladder</kwd>
        <kwd>Resource-constrained devices</kwd>
        <kwd>Side-channel resistance</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>
