<?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-3058</article-id>
      <title-group>
        <article-title>Isogeny-based cryptosystems for post-quantum security</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Kapgate</surname>
            <given-names>R. A.</given-names>
          </name>
          <aff>Department of Mechatronics Engineering, Sanjivani College of Engineering, Savitribai Phule Pune University, Kopargaon, Ahilyanagar, Maharashtra, 423603, India</aff>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Raju</surname>
            <given-names>Dheeravath</given-names>
          </name>
          <aff>Centre for Multidisciplinary Research, Anurag University, Hyderabad, Telangana, 500088, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Vaghela</surname>
            <given-names>Chetansinh R.</given-names>
          </name>
          <aff>Faculty of Science, Gokul Global University, Sidhpur, Gujarat, 384151, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Balan</surname>
            <given-names>Neema Sajju</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 contrib-type="author">
          <name>
            <surname>Barde</surname>
            <given-names>Amol</given-names>
          </name>
          <aff>Department of Mechanical Engineering, Vishwakarma Institute of Technology, Pune, Maharashtra, 411037, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Pidugu</surname>
            <given-names>Krishna Chaitanya</given-names>
          </name>
          <aff>Department of CSE (Artificial Intelligence), Pragati Engineering College, Surampalem, Kakinada District, Andhra Pradesh, 533437, India</aff>
        </contrib>
      </contrib-group>
      <volume>29</volume>
      <issue>10-B</issue>
      <fpage>4369</fpage>
      <lpage>4381</lpage>
      <pub-date date-type="pub">
        <day>31</day>
        <month>10</month>
        <year>2026</year>
      </pub-date>
      <abstract>
        <p>The fast progress of quantum computing is a serious threat to classical cryptographic schemes like RSA and elliptic curve cryptography, and it is time to come up with safe post-quantum schemes. One of the new solutions is isogeny-based cryptography which has attracted attention because of its good-security basis and comparatively small key sizes. Nevertheless, currently used post-quantum cryptographic (PQC) designs, such as lattice-based and code-based ones, are typically characterized by the high key sizes, high computational costs, or scaling issues, with the necessity to have a well-balanced and efficient cryptographic design. This paper presents a powerful isogeny-based cryptosystem, which can allow safe communication in the post-quantum context. The mathematical complexity of isogenies over supersingular elliptic curves forms the foundation of the proposed framework and it has a structured architecture comprising of parameterization, key generation, encryption/decryption and communication layers. The design of the optimization of algorithms to generate keys, exchange keys securely and encrypt messages using shared secret derivation mechanisms is part of the methodology. Security analysis is also carried out to assess the resistance to quantum attacks and against known cryptanalytic vulnerabilities. The metrics used to conduct performance evaluation are computed cost, key size, and latency, and the results are compared to typical PQC schemes, like lattice-based (Kyber) and code-based (McEliece) systems. The results show that the model proposed has much smaller key sizes (330 bytes public key) with moderate computational efficiency although a little bit more latency than lattice-based methods.</p>
      </abstract>
      <kwd-group>
        <kwd>Post-quantum cryptography (PQC)</kwd>
        <kwd>Isogeny-based cryptography</kwd>
        <kwd>Supersingular elliptic curves</kwd>
        <kwd>SIDH</kwd>
        <kwd>SIKE</kwd>
        <kwd>Quantum-resistant security</kwd>
        <kwd>Key exchange</kwd>
        <kwd>Cryptographic algorithms</kwd>
        <kwd>Secure communication</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>
