<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>M. Saleh);</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Advancements in quantum computing: challenges and future directions for cryptography</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mohammed Saleh</string-name>
          <email>mohammed.ahmed@umsedu.my</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Saule Amanzholova</string-name>
          <email>s.amanzholova@astanait.edu.kz</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ali Abd Almisreb</string-name>
          <email>a.almisreb@iitu.edu.kz</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Khalifa Chekima</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ashraf O. Ibrahim</string-name>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Murizah Kassim</string-name>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Astana IT University</institution>
          ,
          <addr-line>Astana, 020000</addr-line>
          ,
          <country country="KZ">Kazakhstan</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>International Information Technology University</institution>
          ,
          <addr-line>Manas St. 34/1, Almaty, 050040</addr-line>
          ,
          <country country="KZ">Kazakhstan</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Universiti Malaysia Sabah</institution>
          ,
          <addr-line>Kota Kinabalu, 88400</addr-line>
          ,
          <country country="MY">Malaysia</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Universiti Teknologi MARA</institution>
          ,
          <addr-line>Shah Alam, 40450</addr-line>
          ,
          <country country="MY">Malaysia</country>
        </aff>
        <aff id="aff4">
          <label>4</label>
          <institution>Universiti Teknologi PETRONAS</institution>
          ,
          <addr-line>Perak, 32610</addr-line>
          ,
          <country country="MY">Malaysia</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2026</year>
      </pub-date>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>Quantum computing represents a revolutionary shift in computational capabilities, posing significant threats to existing cryptographic systems by rendering widely-used public-key schemes vulnerable to Shor's algorithm and symmetric-key systems vulnerable to Grover's algorithm. This study comprehensively explores key advancements in quantum computing and their implications for cryptography, focusing on the urgent need to transition to quantum-safe security. Our analysis combines a mixed-methods approachusing quantitative assessments of algorithm efficiency with qualitative insights into implementation challenges-to evaluate defense strategies. Results confirm the promise of Post-Quantum Cryptography (PQC) families, such as lattice-based and hash-based cryptography, while revealing that practical deployment is hindered by critical challenges like computational overhead and the need for global standardization. The study establishes that a multi-layered defense strategy, prioritizing the immediate adoption of hybrid cryptographic frameworks, is essential for a secure transition. We conclude with strategic imperatives for researchers and policymakers, emphasizing the urgent need for scalable innovation and policy support to develop resilient cryptographic systems and guide the move toward a quantum-secure future.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>quantum
algorithms</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>
        Quantum computing may revolutionize fields like cryptography, optimization, and complex
problem-solving [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Unlike classical bits, qubits exploit superposition and entanglement for
exponentially faster computations [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], threatening large-number factoring that underpins modern
encryption [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. This imperils cryptosystems like RSA and ECC, which rely on factorization and
discrete logarithms [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ][
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Algorithms such as Shor’s could solve these problems in polynomial
time [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], risking exposure of sensitive data [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
      </p>
      <p>
        To counter quantum threats, various quantum-resistant methods – lattice-based, code-based, and
hash-based – have been proposed [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], [10]. However, widespread adoption is hampered by high
computational overhead, complex implementation, and the need for standards [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], [11]. For example,
lattice-based solutions resist quantum attacks but demand significantly more processing power [12].
      </p>
      <p>This study evaluates the state of quantum-resistant cryptography and proposes strategies to
optimize post-quantum algorithms. Through quantitative performance analysis and expert insights,
it aims to answer: (1) What quantum advances threaten existing cryptography? (2) How can
quantum-resistant methods be optimized for real-world use? (3) What role do international standards
play in adopting post-quantum solutions?</p>
      <p>The key contributions of the paper can be summarize as follow:



</p>
      <p>Comprehensive analysis of mixed method of quantitative and expert ideas that provide
examination of quantum threats to present cryptographic protocols.</p>
      <p>Evaluate the security performance of post-quantum systems (e.g., lattice-based, hash-based)
compared to previous systems in terms of capability to adapt to each changing environment.
Identify the gaps in acceptance and standardization of quantum-resistant algorithms in
deploying them in the real world.</p>
      <p>Provide a guidance for researcher and decision maker to speed the migration to quantum
secure cryptographic systems.</p>
      <p>This paper is structured as follows: Section 2 covers the methodology used for the collection and
analysis of relevant literature. Section 3 presents the results of this analysis, highlighting key findings
from the reviewed papers. The final section concludes the study, discussing the implications of these
findings and offering recommendations for future research directions.</p>
    </sec>
    <sec id="sec-3">
      <title>2. Methodology</title>
      <p>This systematic review aims to comprehensively analyze the current state of research on
advancements in quantum computing and their implications for cryptography. The methodology
follows established guidelines for conducting and reporting systematic reviews to ensure
transparency, reproducibility, and rigor.</p>
      <sec id="sec-3-1">
        <title>2.1. Literature search strategy</title>
        <p>A thorough literature search was carried out to find pertinent papers across several respected
academic databases. ACM Digital Library: To cover a broad range of computing literature; Scopus
and Web of Science: To provide multidisciplinary coverage of peer-reviewed journals and conference
proceedings; Google Scholar: To gather more pertinent publications, including grey literature; IEEE
Xplore: To provide access to cutting-edge engineering and technology research, especially in
quantum computing and cryptography. Boolean operators and targeted keywords were used in the
search strategy to maximize the retrieval of relevant literature. The phrases utilized were: "Quantum
computing," "Post-quantum cryptography," "Quantum algorithms," "Cryptographic security,"
"Lattice-based cryptography," "Shor's algorithm," "Quantum-resistant encryption," along with
"Quantum key distribution." The search terms were customized to fit the unique syntax of each
database. A literature search for articles from the most recent years was done in order to concentrate
on the most recent developments in the subject. Only English-language publications were taken into
consideration to ensure uniformity.</p>
      </sec>
      <sec id="sec-3-2">
        <title>2.2. Inclusion and exclusion criteria</title>
        <p>In selecting studies, we included research on quantum computing advancements relevant to
cryptography, discussions of quantum-resistant methods and their optimization, analyses of
quantum computing’s impact on existing encryption standards, and peer-reviewed or authoritative
reports. We excluded non-peer-reviewed works such as editorials and opinion pieces, studies
focusing solely on theoretical aspects without practical cryptographic implications, and topics not
directly related to quantum computing and cryptographic security.</p>
      </sec>
      <sec id="sec-3-3">
        <title>2.3. Study selection process</title>
        <p>The selection process proceeded in stages to maintain a thorough, unbiased review. Two independent
reviewers initially screened titles and abstracts to identify potentially relevant studies, resolving any
discrepancies through discussion or consultation with a third reviewer. Next, the full texts of these
studies were evaluated against the inclusion and exclusion criteria, and those meeting all
requirements were included in the final review.</p>
      </sec>
      <sec id="sec-3-4">
        <title>2.4. Data extraction and synthesis</title>
        <p>A standardized data extraction form was used to gather bibliographic details (journal or conference,
publication year, and authors), study objectives, methodologies (design, computer models,
experiments, and analyses), key findings, and strengths or weaknesses. A thematic analysis then
revealed recurring themes, trends, and gaps in the literature. Studies were grouped into categories
such as Quantum Algorithm Developments, Quantum Hardware Progress, Post-Quantum
Cryptography Advancements, Quantum Key Distribution Innovations, and Cryptographic Threat
Mitigation Strategies. Figure 1 illustrates the search and screening process.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>3. Results</title>
      <p>Quantum computing is poised to revolutionize cryptography by introducing computational
capabilities that challenge the foundations of current security protocols. As quantum technologies
advance, understanding their implications for cryptography becomes imperative. This section
comprehensively examines significant technological advancements in quantum computing relevant
to cryptography. We focus on transformative quantum algorithms that threaten existing
cryptographic schemes, progress in quantum hardware that brings these algorithms closer to
practical implementation, developments in post-quantum cryptography (PQC) as defenses against
quantum attacks, innovations in quantum key distribution (QKD) offering new avenues for secure
communication, and strategies to mitigate emerging cryptographic threats posed by quantum
capabilities.</p>
      <sec id="sec-4-1">
        <title>3.1. Transformative quantum algorithms</title>
        <p>Quantum algorithms have been pivotal in demonstrating the potential of quantum computing to
disrupt classical cryptographic systems:</p>
        <p>Threats to Existing Cryptographic Algorithms: Recent studies underscore the looming threat
quantum computing presents to existing encryption algorithms. Shukla [13] emphasizes that
traditional cryptographic methods may soon become vulnerable to quantum attacks, necessitating
urgent attention. Mittal [14] highlights the dual potential of quantum computing to enhance
information processing while simultaneously threatening data security.</p>
        <p>Shor’s Algorithm: Introduced by Shor [15], this algorithm provides an exponential speedup for
factoring large integers and computing discrete logarithms, directly threatening public-key
cryptosystems such as RSA and ECC. Abhishek and Ramesh [16] examine the vulnerability of these
widely used encryption schemes in a quantum-enabled environment, asserting that they may become
obsolete unless restructured to integrate quantum-resistant algorithms.</p>
        <p>Grover’s Algorithm: Proposed by Grover [17], this algorithm offers a quadratic speedup for
unstructured search problems, effectively reducing the security of symmetric-key algorithms by half.
Verma and Singh [18] discuss algorithmic approaches to enhance the robustness of symmetric
encryption systems, advocating for adjustments to key lengths and algorithms to maintain security
in a quantum context.</p>
      </sec>
      <sec id="sec-4-2">
        <title>3.2. Advances in quantum hardware</title>
        <p>Progress in quantum hardware has accelerated the potential practical implementation of quantum
algorithms:</p>
        <p>Quantum Processors: Companies like IBM and Google have developed quantum processors with
increasing qubit counts and improved coherence times. Mittal and Sharma [19] present recent
developments in quantum computing hardware, emphasizing how advancements bring us closer to
practical implementations of quantum algorithms that could compromise current cryptographic
systems.</p>
        <p>Error Correction: Enhancing error resilience is essential for achieving reliable and secure
quantum communications. Kaur and Sharma [20] delve into error correction in quantum
cryptographic systems, highlighting the importance of improving error correction mechanisms to
support the development of robust quantum hardware capable of executing complex cryptographic
algorithms.</p>
      </sec>
      <sec id="sec-4-3">
        <title>3.3. Progress in post-quantum cryptography</title>
        <p>The field of PQC has seen significant developments aimed at countering the threats posed by
quantum algorithms:</p>
        <p>Lattice-Based Cryptography: Sodiya et al. [21] and Natarajan et al. [22][15] highlight lattice-based
cryptographic algorithms as promising candidates for post-quantum encryption, noting their
resilience to Shor’s algorithm. These approaches offer a promising path to secure data against
quantum decryption, even if full-scale quantum computing becomes viable.</p>
        <p>Hash-Based and Code-Based Cryptography: Srivastava et al. [23] conduct a comprehensive
survey of quantum-resistant cryptographic protocols, concluding that a multi-layered approach
combining various quantum-resistant techniques, including hash-based and code-based methods,
will be necessary to fully safeguard digital systems in the quantum era.</p>
      </sec>
      <sec id="sec-4-4">
        <title>3.4. Innovations in Quantum Key Distribution (QKD)</title>
        <p>Advancements in QKD highlight its potential for providing unconditional security based on the
principles of quantum mechanics:</p>
        <p>QKD Protocols: Gupta and Joshi [24] underscore the importance of QKD advancements, focusing
on how QKD protocols can offer unbreakable encryption by leveraging quantum entanglement and
superposition principles. Mittal and Sharma [19] emphasize QKD's potential to fundamentally
change secure communication channels.</p>
        <p>Implementation Challenges: Ravshanovna et al. [25] note the logistical challenges of
implementing quantum security measures across existing communication networks, which often
lack compatibility with quantum technologies. Addressing these challenges is crucial for the practical
deployment of QKD systems.</p>
      </sec>
      <sec id="sec-4-5">
        <title>3.5. Addressing "Store Now, Decrypt Later" threats</title>
        <p>The threat of adversaries storing encrypted data now to decrypt later using future quantum
computers is a significant concern [26]:</p>
        <p>Hybrid Cryptographic Frameworks: Shukla et al. [27] and Patel et al. [28] suggest that a blend of
classical and quantum-resistant methods can serve as a transitional strategy to maintain data security
during the gradual adoption of quantum technologies. Implementing hybrid systems provides
immediate security enhancements while PQC technologies mature.</p>
        <p>Zero-Knowledge Proofs and Homomorphic Encryption: Jain and Iyer [29] discuss zero-knowledge
proofs in a quantum context, positing their role in authenticating data without revealing sensitive
information. Khanna et al. [26] explore homomorphic encryption for quantum-safe data processing,
allowing encrypted data to be manipulated without compromising security.</p>
      </sec>
      <sec id="sec-4-6">
        <title>3.6. Implications for blockchain and network security</title>
        <p>Quantum-Resistant Blockchains: Shukla et al. [30] explore the implications of quantum computing
on blockchain technology, emphasizing the urgent need for quantum-resistant blockchains to
preserve the integrity of decentralized ledgers.</p>
        <p>Network Infrastructure Challenges: Ravshanovna and Mohiniso [23] provide an extensive review
of the technological hurdles and security implications of quantum cryptography, advocating for
advancements that leverage quantum mechanics to bolster rather than compromise network
security.</p>
        <p>Table 1 provides an overview of key studies in quantum-resilient cryptography, summarizing
their primary focus, significant findings, and proposed solutions. It highlights the breadth of research
on post-quantum cryptographic methods, quantum key distribution, and hybrid frameworks,
emphasizing the urgency of developing robust quantum-resistant encryption systems.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>4. Discussion</title>
      <p>The advancements highlighted in the results section have profound implications for the future of
cybersecurity and cryptographic practices. This discussion interprets these findings within the
broader context of safeguarding digital information in the quantum era. We delve into the emergence
of post-quantum cryptographic methods as essential tools for resilience, explore the significant
implications for cybersecurity across various sectors, address the multifaceted challenges in
transitioning to PQC, and identify opportunities for innovation that can facilitate this transition. By
critically analyzing these aspects, we aim to provide insights into how the cryptographic community
can adapt to and overcome the challenges presented by quantum computing advancements.</p>
      <sec id="sec-5-1">
        <title>4.1. Emergence of post-quantum cryptographic methods</title>
        <p>The necessity for Quantum-Resistant Algorithms: The vulnerability of current cryptographic
systems, particularly public-key cryptography, in the face of quantum attacks, underscores the
urgent need for quantum-resistant algorithms [13], [16]. The resilience of lattice-based cryptography
to quantum attacks, as highlighted by Natarajan et al. [22], positions it as a leading candidate for
securing future communications.</p>
        <p>Multi-Layered Security Approaches: Srivastava et al. [23] advocate for a multi-layered approach
combining various quantum-resistant techniques to fully safeguard digital systems. This strategy
acknowledges that no single solution may be sufficient to address all quantum threats.</p>
      </sec>
      <sec id="sec-5-2">
        <title>4.2. Implications for cybersecurity</title>
        <p>Quantum computing poses substantial risks to current cryptographic infrastructures, necessitating
urgent action:</p>
        <p>Data Confidentiality and Integrity: The "store now, decrypt later" threat emphasizes the
importance of protecting sensitive data today to prevent future breaches [26]. Industries such as
finance, healthcare, and government rely on secure communications, and failure to transition to
quantum-safe solutions could lead to widespread vulnerabilities [15].</p>
        <p>Blockchain Security: Shukla et al. [30] highlight the implications of quantum computing on
blockchain technology, stressing the need for quantum-resistant blockchains to maintain the
integrity of decentralized ledgers critical to various applications, including cryptocurrencies and
smart contracts.</p>
      </sec>
      <sec id="sec-5-3">
        <title>4.3. Challenges in transitioning to PQC</title>
        <p>Standardization and Implementation: Global consensus and collaboration are essential for the
successful standardization and adoption of PQC protocols [25], [25]. Patel et al. [28] suggest that
hybrid cryptographic frameworks can serve as a transitional strategy during the gradual adoption of
quantum technologies.</p>
        <p>Infrastructure Readiness: Implementing quantum security measures across existing
communication networks presents logistical challenges [23], [25]. Compatibility issues and the need
for significant upgrades hinder the immediate deployment of quantum-resistant solutions.</p>
        <p>Resource Constraints: The increased computational and storage requirements of many PQC
algorithms pose difficulties for devices with limited resources, such as IoT devices. Research into
optimizing these algorithms for low-power environments is critical [21].</p>
      </sec>
      <sec id="sec-5-4">
        <title>4.4. Opportunities for innovation</title>
        <p>
          Hybrid cryptographic systems that integrate both classical and quantum-resistant methods offer a
practical security approach during the transition period [34][35][36]. Enhanced quantum key
distribution (QKD) protocols, highlighted by Gupta and Joshi, leverage quantum mechanics for
potentially unbreakable encryption, which is crucial for critical infrastructure and sensitive
communications [34]. Meanwhile, new mechanisms like zero-knowledge proofs in a quantum
context and homomorphic encryption further strengthen security frameworks [37][
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. Improved
error resilience, supported by quantum hardware and error-correction advances, is essential for
reliable communications [38][34]. Table 2 compares major post-quantum methods – lattice-based,
code-based, hash-based, multivariate, isogeny-based, and hybrid – across key attributes, including
security basis, performance overhead, implementation challenges, and known vulnerabilities,
guiding the selection of suitable techniques for various applications.
        </p>
        <p>Table 3 evaluates post-quantum cryptographic approaches against critical criteria such as security
foundation, key size, computational efficiency, resistance to attacks, and readiness for adoption. It
serves as a concise guide for understanding the trade-offs and practical considerations involved in
implementing quantum-resistant encryption solutions.</p>
        <p>
          Solving high-degree Recent cryptanalytic breakthroughs have [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ], [31],
polynomial systems over weakened some schemes, but research [32]
finite fields continues in robust variants
        </p>
        <sec id="sec-5-4-1">
          <title>Attacks</title>
        </sec>
        <sec id="sec-5-4-2">
          <title>Refe.</title>
        </sec>
        <sec id="sec-5-4-3">
          <title>Few practical breaks so far; some [21], [22], parameter sets occasionally attacked but [20] quickly revised</title>
        </sec>
        <sec id="sec-5-4-4">
          <title>Attacks focus on special code structures; [18], [23] classic McEliece remains generally secure</title>
        </sec>
        <sec id="sec-5-4-5">
          <title>No known full breaks of well-chosen</title>
          <p>hash functions; main limitation is the
one-time or few-time signature nature</p>
        </sec>
        <sec id="sec-5-4-6">
          <title>Some new attacks (e.g., SIDH breaks) have impacted trust; active research on mitigating vulnerabilities</title>
        </sec>
        <sec id="sec-5-4-7">
          <title>No direct single point of failure; some complexity in key management and standardization remains [28], [30]</title>
          <p>Figure 2 illustrates the focus area distribution across studies from 2023 to 2024. A noticeable
concentration of research efforts can be observed in areas such as hybrid cryptographic frameworks
and adaptation of cryptographic systems, indicating growing attention to practical post-quantum
solutions.</p>
          <p>Quantum computing’s rapid progress both challenges and reshapes cybersecurity. Algorithms
like Shor’s [15] and Grover’s [17] expose vulnerabilities in current public-key and symmetric-key
systems, underscoring the need for quantum-resistant solutions such as lattice-based methods [21],
[22]. While these approaches show promise, they face practical barriers related to scalability,
resource demands, and integration [23], [25]. Quantum key distribution (QKD) offers another
security layer but remains limited by infrastructure costs and technical constraints [19], [24].
Consequently, hybrid frameworks [27], [28] and multi-layered approaches [23] will be pivotal in
safeguarding digital systems.</p>
          <p>Moving forward, four actions are crucial: Global Collaboration: International coordination
ensures standardization and broad adoption of post-quantum cryptography [25], [28]. Lightweight,
Scalable Innovation: Research must yield efficient and resource-friendly cryptographic methods to
suit diverse sectors [21], [20].</p>
          <p>Hybrid Cryptographic Adoption: Blending current and quantum-resistant techniques offers
security throughout the transition [27], [28]. Policy and Regulatory Support: Governments should
provide funding, guidelines, and incentives to hasten adoption [30], [15].</p>
          <p>By embracing proactive measures today, the cryptographic community can fortify data integrity
and confidentiality against emerging quantum threats, ensuring resilient security for future
generations.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>5. Conclusion</title>
      <p>Quantum computing presents an imminent, dual-edged challenge to the field of cryptography,
offering potential advancements while simultaneously threatening the foundational security of
current digital systems. This paper's comprehensive analysis of recent technological progress in
quantum computing and quantum-resistant cryptography reveals several critical findings that define
the urgency and strategic direction of the transition to quantum-safe security.</p>
      <p>The analysis confirms that Shor's and Grover's algorithms pose an existential threat to all widely
used classical public-key (e.g., RSA and ECC) and symmetric-key cryptosystems, respectively.
Crucially, advances in quantum hardware, characterized by increasing qubit counts and improved
error correction, are accelerating the timetable for the practical implementation of these disruptive
algorithms. This progress magnifies the pervasive "store now, decrypt later" threat, underscoring the
necessity for immediate protective measures for long-term sensitive data, particularly across
highvalue sectors.</p>
      <p>Research has identified robust Post-Quantum Cryptography (PQC) families, primarily
latticebased cryptography and hash-based cryptography, as leading candidates with strong security proofs
against known quantum attacks. However, a comparative evaluation (Tables 2 and 3) exposes
significant practical trade-offs. For instance, while lattice methods offer strong security and
scalability, they present implementation complexity and potential large key sizes in constrained
environments. Similarly, code-based methods possess a long-standing security basis but are
hampered by huge key sizes. This inherent variation mandates a nuanced, application-specific
approach to algorithm selection, moving decisively away from reliance on a single cryptographic
solution.</p>
      <p>The most practical immediate strategy identified is the adoption of Hybrid Cryptographic
Frameworks. These blend classical and PQC algorithms, providing an essential and secure
transitional path that ensures backward compatibility and immediate security enhancement during
the gradual standardization and maturation of full PQC protocols. The findings strongly advocate for
a multi-layered security approach combining various quantum-resistant techniques to fully
safeguard digital systems and critical infrastructure, including blockchain technology. While
Quantum Key Distribution (QKD) protocols offer a theoretically unbreakable channel, the analysis
highlighted significant practical barriers to widespread deployment, including logistical challenges in
integrating QKD into existing communication network infrastructure and achieving the necessary
infrastructure readiness and standardization. Furthermore, new innovation opportunities, such as
the use of zero-knowledge proofs and homomorphic encryption, are emerging as vital tools to
strengthen security frameworks and enable quantum-safe data processing without compromising
confidentiality during this transition.</p>
      <p>In summary, the transition to quantum-resilient security is not merely a future consideration but
an urgent present-day imperative. The evidence presented highlights that a defense strategy based on
technical innovation, strategic foresight, and policy support is required. The path forward demands
Global Collaboration and Standardization to ensure consensus and broad adoption of PQC protocols,
Lightweight, Scalable Innovation to address the computational overhead for resource-constrained
devices, Proactive Deployment of Hybrid Cryptographic Adoption as the secure, practical, and
interim measure, and Strong Policy and Regulatory Support to accelerate the compulsory
implementation of quantum-safe defenses across critical sectors. By embracing these proactive,
multi-faceted measures today, the cryptographic community can fortify data integrity and
confidentiality against emerging quantum threats, ensuring resilient security for future generations.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgment</title>
      <p>The authors would like to express their sincere gratitude to Astana IT University, Kazakhstan, and
Universiti Malaysia Sabah, Malaysia, for their support in the development and dissemination of this
article.</p>
    </sec>
    <sec id="sec-8">
      <title>Declaration on Generative AI</title>
      <p>During the preparation of this work, the authors used ChatGPT-4 and DeepSeek to check grammar
and spelling. After using these tools, the authors reviewed and edited the content as needed and took
full responsibility for the publication’s content.
[10] L. Chen et al., “Report on Post-Quantum Cryptography,” National Institute of Standards and</p>
      <p>Technology, vol. 4, 2016.
[11] J. Alperin-sheriff, J. Kelsey, C. Miller, R. Peralta, and D. Smith-tone, “Status Report on the Second
Round of the NIST Post-Quantum Cryptography Standardization Process” National Institute of
Standards and Technology, 2020.
[12] C. Peikert, “A decade of lattice cryptography,” Foundations and Trends in Theoretical Computer</p>
      <p>Science, vol. 10, no. 4, 2016.
[13] A. Shukla, “Future of Current Encryption Algorithm in Quantum Computing Age and their</p>
      <p>Future,” International Journal of Science and Research (IJSR), vol. 12, no. 10, 2023.
[14] M. Mittal, “Quantum Computing and Information: Recent Developments and Future Prospects,”</p>
      <p>Journal of Quantum Science and Technology, vol. 1, pp. 12–17, Jul. 2024.
[15] P. W. Shor, “Algorithms for quantum computation: Discrete logarithms and factoring,” in</p>
      <p>Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, 1994.
[16] A. K. Pandey, A. Banati, B. Rajendran, S. D. Sudarsan, and K. K. S. Pandian, “Cryptographic
Challenges and Security in Post Quantum Cryptography Migration: A Prospective Approach,”
in IEEE International Conference on Public Key Infrastructure and its Applications, PKIA
Proceedings, 2023.
[17] L. K. Grover, “A fast quantum mechanical algorithm for database search,” in Proceedings of the</p>
      <p>Annual ACM Symposium on Theory of Computing, 1996.
[18] R. Cyriac, S. Eswaran, S. Selvarajan, and D. Yuvaraj, “Quantum Computing in Cryptographic
Systems,” International Journal of Advanced IT Research and Development (IJAITRD), vol. 1, no.
1, 2024.
[19] M. K. Pasupuleti, “Quantum Computing and the Future of Digital Security,” in Quantum</p>
      <p>Computing: The Next Information Age, National Education Services, 2024, pp. 41–58.
[20] D. Kumari, A. Namburi “Quantum Computing in Cryptography,” in Proceedings - 2023
International Conference on Computational Science and Computational Intelligence, CSCI 2023,
Institute of Electrical and Electronics Engineers Inc., 2023, pp. 490–495.
[21] Vimmi Malhotra, Sahil Yadav, and Vishal, “Quantum Cryptography: Advancements, Challenges,
and Applications in Modern Communication,” International Journal of Advanced Research in
Science, Communication and Technology, pp. 551–558, Apr. 2024.
[22] P. Radanliev, “Artificial intelligence and quantum cryptography,” 2024.
[23] M. S. Akter, J. Rodriguez, “Quantum Cryptography for Enhanced Network Security: A
Comprehensive Survey of Research, Developments, and Future Directions,” in Proceedings
IEEE International Conference on Big Data, 2023.
[24] P. R. Chandre, B. D., “Machine Learning-Enhanced Advancements in Quantum Cryptography: A
Comprehensive Review and Future Prospects,” International Journal on Recent and Innovation
Trends in Computing and Communication, vol. 11, no. 11s, 2023.
[25] M. K. Pasupuleti, “Advancements in Quantum Computing and Information Science,” in
Quantum Computing and Quantum Information Science, National Education Services, 2024, pp.
62–107.
[26] V. Vasani, S. Maity, and A. D. Dwivedi, “Embracing the quantum frontier: Investigating quantum
communication, cryptography, applications and future directions,” 2024.
[27] B. Yamini, R. Nithyanandhan, and K. Sudha, “Maximizing the Revolutionary Potential of
Quantum Computing: Challenges, Opportunities, and Future Directions,” in Proceedings of the
2024 10th International Conference on Communication and Signal Processing, ICCSP 2024,
Institute of Electrical and Electronics Engineers Inc., 2024, pp. 756–761.
[28] S. R. Sihare, “The Potential of Quantum Cryptography in Securing Future Communication</p>
      <p>Channels,” 2024, pp. 127–179.
[29] S. K. Sahu and K. Mazumdar, “State-of-the-art analysis of quantum cryptography: applications
and future prospects,” 2024, Frontiers Media SA.
[30] Rakibul Hasan Chowdhury, “Quantum-resistant cryptography: A new frontier in fintech
security,” World Journal of Advanced Engineering Technology and Sciences, vol. 12, no. 2, pp.
614–621, Jul. 2024.
[31] Sodiya, Joseph, Amoo, and Akoh, “Quantum computing and its potential impact on U.S.
cybersecurity: A review: Scrutinizing the challenges and opportunities presented by quantum
technologies in safeguarding digital assets,” Global Journal of Engineering and Technology
Advances, vol. 18, no. 2, 2024.
[32] Sonko, Ibekwe, Ilojianya, and Fabuyide, “Quantum Cryptography And U.S. Digital Security: A
Comprehensive Review: Investigating The Potential Of Quantum Technologies In Creating
Unbreakable Encryption And Their Future In National Security,” Computer Science &amp; IT
Research Journal, vol. 5, no. 2, 2024.
[33] B. Singh, M. Ahateshaam, A. Lahiri, and A. K. Sagar, “Future of Cryptography in the Era of</p>
      <p>Quantum Computing,” in Lecture Notes in Electrical Engineering, 2024.
[34] N. A. Peters, M. Alshowkan, J. C. Chapman, R. C. Pooser, N. S. V. Rao, and R. T. Newell,
“Longterm cybersecurity applications enabled by quantum networks,” 2023.
[35] A. Holcomb, G. Pereira, B. Das, and M. Mosca, “PQFabric: A permissioned blockchain secure
from both classical and quantum attacks,” in IEEE International Conference on Blockchain and
Cryptocurrency, ICBC 2021, 2021.
[36] Dr. R. Campbell, Dr. W. Diffie, and C. Robinson, “Advancements in Quantum Computing and AI</p>
      <p>May Impact PQC Migration Timelines,” Feb. 2024.
[37] S. Fatima and S. Ahmad, “Quantum key distribution approach for secure authentication of cloud
servers,” International Journal of Cloud Applications and Computing, vol. 11, no. 3, 2021.
[38] I. Georgescu, “25 years of quantum error correction,” Nat Rev Phys 2, 519 (2020)</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>E. and M. National</surname>
          </string-name>
          <article-title>Academies of Sciences, “Quantum Computing: Progress and Prospects</article-title>
          ,” Dec.
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>J.</given-names>
            <surname>Preskill</surname>
          </string-name>
          , “
          <article-title>Quantum computing in the NISQ era and beyond</article-title>
          ,” Quantum, vol.
          <volume>2</volume>
          ,
          <year>2018</year>
          , doi: 10.22331/q-2018
          <source>-08-06-79.</source>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Nielsen</surname>
          </string-name>
          and
          <string-name>
            <given-names>I. L.</given-names>
            <surname>Chuang</surname>
          </string-name>
          ,
          <source>Quantum Computation and Quantum Information (Cambridge Series on Information and the Natural Sciences)</source>
          , vol.
          <volume>1</volume>
          , no.
          <issue>11</issue>
          .
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>P. W.</given-names>
            <surname>Shor</surname>
          </string-name>
          , “
          <article-title>Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,”</article-title>
          <source>SIAM Journal on Computing</source>
          , vol.
          <volume>26</volume>
          , no.
          <issue>5</issue>
          ,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>R. L.</given-names>
            <surname>Rivest</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shamir</surname>
          </string-name>
          , and L. Adleman, “
          <article-title>A Method for Obtaining Digital Signatures</article-title>
          and PublicKey Cryptosystems,”
          <string-name>
            <surname>Commun</surname>
            <given-names>ACM</given-names>
          </string-name>
          , vol.
          <volume>21</volume>
          , no.
          <issue>2</issue>
          ,
          <year>1978</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>V. S.</given-names>
            <surname>Miller</surname>
          </string-name>
          , “
          <article-title>Use of Elliptic Curves in Cryptography,”</article-title>
          <source>in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</source>
          , Springer Verlag,
          <year>1986</year>
          , pp.
          <fpage>417</fpage>
          -
          <lpage>426</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>N.</given-names>
            <surname>Torii</surname>
          </string-name>
          and
          <string-name>
            <given-names>K.</given-names>
            <surname>Yokoyama</surname>
          </string-name>
          , “
          <article-title>Elliptic curve cryptosystem,” Fujitsu Scientific</article-title>
          and
          <source>Technical Journal</source>
          , vol.
          <volume>36</volume>
          , no.
          <issue>2</issue>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>D. J.</given-names>
            <surname>Bernstein</surname>
          </string-name>
          and
          <string-name>
            <given-names>T.</given-names>
            <surname>Lange</surname>
          </string-name>
          , “
          <article-title>Post-quantum cryptography</article-title>
          ,
          <source>” Nature</source>
          , vol.
          <volume>549</volume>
          , no.
          <issue>7671</issue>
          , pp.
          <fpage>188</fpage>
          -
          <lpage>194</lpage>
          , Sep.
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>D. J.</given-names>
            <surname>Bernstein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Lange</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Peters</surname>
          </string-name>
          , “
          <article-title>Attacking and defending the McEliece cryptosystem</article-title>
          ,
          <source>” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>