Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Frontiers of Engineering and Emerging Technologies (FET)

Assessing Quantum Threats to Cryptographic Hash Structures in Cyber Defense Systems Using Grover Based Oracle Modeling

Santi Amalia Ar-Nur, Teddy Mantoro

Published Apr 22, 2026• 0 citations
Publisher

Abstract

The advancement of quantum computing poses emerging challenges to cryptographic hash functions that underpin modern cyber defense systems. In particular, Grover’s algorithm theoretically offers a quadratic speedup for preimage search, potentially reducing the effective security margin of hash-based primitives used to protect long-lived strategic data. This study adopts a structure-oriented perspective to analyze ARX-like and sponge-like hash constructions using Grover-based oracle modeling. Reversible toy hash abstractions are employed to construct quantum oracles and simulate Grover attacks under both ideal (noise-free) and Noisy Intermediate-Scale Quantum (NISQ) conditions. The analysis evaluates success probability, oracle cost, and noise sensitivity. Results show non-monotonic amplitude amplification under ideal conditions, with structural differences affecting phase behavior. However, under realistic noise, amplitude amplification is significantly attenuated for both constructions, limiting practical quantum advantage. The findings further show that oracle complexity, reflected in circuit depth and multi-qubit gate usage, plays a dominant role in determining attack feasibility beyond asymptotic complexity reductions. This work provides a structure-level framework for assessing quantum risks to cryptographic hash functions and supports informed post-quantum cyber defense planning.

DOI
10.1109/fet68771.2026.11601850

Related papers

Practical Reliability Constraints on Grover-Based Quantum Attacks Against Symmetric Cryptography

José Israel Nadal Vidal

Grover’s algorithm represents a cornerstone quantum attack against symmetric cryptography, offering a quadratic speedup for exhaustive key search. While its theoretical properties are well established, the practical robustness of Grover’s algorithm under non-ideal oracle execution remains insufficiently quantified, particularly in security-relevant contexts. This work presents a comprehensive quantitative analysis of Grover’s robustness against intermittent oracle failures, modeling realistic execution imperfections that may arise in practical quantum attack scenarios. Using a reduced two-dimensional representation of amplitude amplification, we define and measure a practical reliability threshold beyond which Grover’s success probability collapses abruptly. Our results demonstrate that this threshold decreases exponentially with problem size, scaling as \( p^{\ast}(n) \propto 2^{-n/2} \), implying that cryptographically relevant problem sizes require unrealistically high oracle reliability to preserve quantum advantage. For \( n=40 \), the oracle must fail less than once every \( \sim 800{,}000 \) iterations to preserve practical advantage, a requirement that becomes exponentially more stringent for larger key sizes. These findings do not contradict Grover’s theoretical correctness but highlight critical robustness limitations that must be explicitly considered when assessing quantum threats to symmetric cryptography. We provide actionable insights for post-quantum security assessment by translating abstract quantum assumptions into concrete reliability requirements, demonstrating that the practical feasibility of Grover-based attacks may be significantly lower than commonly assumed under realistic hardware constraints.

•Feb 3, 2026•0 citations

Quantum Hashing: A Theoretical Framework for Post-Quantum Secure Data Structures

Pulkit Sharma

The rapid advancement of quantum computing presents a fundamental challenge to modern cryptographic security, particularly in the domain of hash functions that ensure data integrity, authentication, and blockchain security. Traditional crypto graphic hash functions such as SHA-256, SHA-3, and BLAKE2 rely on computational hardness assumptions that become obsolete in the presence of large-scale quantum computers. Shor’s algorithm can efficiently break RSA and ECC-based cryptosys tems, while Grover’s algorithm reduces the security of traditional hash functions by square root complexity, significantly weakening their preimage and collision resistance. This quantum threat necessitates the development of post-quantum secure hashing techniques that remain resilient against both classical and quantum adversaries. This paper proposes Quantum Hashing, a novel cryptographic framework that integrates quantum entanglement, lattice-based cryptography, and hybrid quantum classical hashing to construct post-quantum secure hash functions. We introduce a formal model for Quantum Collision Resistance (QCR) and provide entropy-based ran domness enhancement to ensure unpredictable hash outputs. Unlike classical hashing approaches, our framework leverages the hardness of lattice problems (e.g., Shortest Vector Problem, Learning with Errors) to withstand quantum attacks while incorpo rating Quantum Key Distribution (QKD) mechanisms to enhance entropy and key management. Furthermore, we evaluate the security of Quantum Hashing under various attack models, comparing its resistance against Grover’s search and collision attacks. We benchmark its performance against NIST Post-Quantum Cryptography (PQC) final ists, including CRYSTALS-DILITHIUM, SPHINCS+, and Falcon, demonstrating that our approach offers superior resilience while maintaining computational feasibility. Additionally, we present an implementation of Quantum Hashing using Qiskit, show casing its practical applicability in quantum circuits and quantum-secure blockchain architectures. Our findings highlight that Quantum Hashing provides a scalable, entropy-efficient, and post-quantum resilient cryptographic primitive suitable for next-generation cryptographic applications. This work paves the way for secure post-quantum digital signatures, blockchain consensus mechanisms, and zero-knowledge proof systems that require tamper-resistant hashing in a quantum computing era.

•Apr 9, 2025•0 citations

Evaluating the Impact of Quantum Algorithms on Modern Cybersecurity Mechanisms

Mallu Shiva Rama Krishna, Patwari KrishnaRao, Manumula Srinubabu

Abstract—The emergence of quantum computing represents a fundamental challenge to contemporary cryptographic infras- tructures, mandating immediate adoption of quantum-resistant cryptographic standards to ensure long-term security. This paper analyzes how Shor’s algorithm renders RSA , ECC vulnerable by solving integer factorization and discrete alogarithm problems in polynomial time, while Grover’s algorithm weakens symmetric encryption through quadratic speedup attacks. Through compre- hensive cryptanalysis, we evaluate the vulnerabilities of current public-key infrastructures, symmetric ciphers, and hash functions against quantum threats. Our research systematically examines post-quantum cryptographic candidates, including lattice-based, hash-based, and multivariate polynomial schemes under NIST standardization, assessing their security guarantees and imple- mentation challenges. Furthermore, we investigate the broader implications for secure communications, blockchain networks, and authentication protocols in a post-quantum world. Based on our findings, we propose a practical transition framework featuring hybrid cryptographic systems, protocol enhancements, and policy updates to facilitate seamless migration. This work provides critical insights and actionable strategies for securing digital infrastructure against quantum threats while maintaining operational efficiency during the transition period. Index Terms—Cryptographic vulnerability, Grover’s algo- rithm, Post-quantum cryptography, Quantum computing, Quan- tum key distribution, Shor’s algorithm, Cybersecurity

INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT•Jun 13, 2025•1 citation

A hybrid hash framework for post quantum secure zero knowledge identification

Samarth Bhadane, Disha Gupta, Priyanka V. Deshmukh +1 more

The advent of quantum computing poses substantial risks to conventional cryptographic mechanisms, particularly hash-based authentication and zero-knowledge identification (ZKI) protocols, which are susceptible to quantum algorithms such as Grover's and Shor's. This study presents a comprehensive benchmarking framework for evaluating the quantum resistance of cryptographic hash functions through performance metrics (execution time, memory utilization), statistical characteristics (entropy, bit-level randomness, avalanche effect), and security attributes (collision and preimage resistance) across diverse input sizes and edge conditions. A novel hybrid hashing strategy, integrating SHA-512 and BLAKE3 in a defense-in-depth configuration, is introduced to enhance post-quantum resilience. Its efficacy is validated via Grover's algorithm simulations, demonstrating a methodology for evaluating the increased computational workload for quantum search algorithms relative to conventional hash functions. The framework incorporates visualization utilities and structured reporting modules, enabling systematic assessment and practical implementation of quantum-resistant cryptographic solutions within ZKI systems. Findings indicate that while classical hashes such as SHA-256 and SHA-512 exhibit theoretically diminished security in quantum threat scenarios, the proposed hybrid method acts as a practical risk mitigation strategy with acceptable computational overhead, providing a viable pathway for safeguarding authentication systems against quantum-capable adversaries.

Scientific Reports•Nov 26, 2025•3 citations

Risk Analysis of Information Security Violations and Vulnerabilities in Information Processing Systems: Grover's Algorithm

Mikhail Pavlov

Abstract In computer science, the Church–Turing thesis has long defined the conceptual boundary of classical computation, asserting that any effectively computable function can be executed by a universal Turing machine. While quantum computing does not invalidate this thesis in terms of computability, it challenges classical assumptions regarding computational efficiency and complexity. With the emergence of quantum computation, the circuit model — built upon logical primitives such as NOT and AND in classical systems — finds its quantum counterpart in reversible and unitary gate structures. Within this framework, Grover’s algorithm represents a fundamental advancement: a quantum algorithm capable of solving unstructured search problems with quadratic speedup compared to classical approaches. This work analyzes the implications of Grover’s algorithm for information security risk assessment, particularly in the context of brute-force attacks and search-based cryptanalysis.

•Mar 3, 2026•0 citations

Redefining hash functions for quantum security with SHA 256

Dadan Shavkat Riswantoro, H.A. Danang Rimbawa

The rapid advancement of quantum computing technology presents a significant challenge to the field of cryptography, particularly affecting the security of hash functions that form the foundation of many cryptographic protocols. Hash functions are widely used to ensure data integrity, generate digital signatures, and securely store passwords. However, the emergence of quantum algorithms—such as Grover’s algorithm—threatens to undermine the security assumptions on which these hash functions are based by significantly reducing their effective security levels. This paper aims to provide a comprehensive analysis of the vulnerabilities introduced by quantum computing to traditional hash functions, detailing how these weaknesses can be exploited by quantum adversaries. We explore the fundamental properties of hash functions, including pre-image resistance, second pre-image resistance, and collision resistance, and assess how these properties are affected in a quantum context. Furthermore, we examine the implications of these vulnerabilities for existing cryptographic systems and emphasize the urgent need for the development of post-quantum cryptographic standards. In response to these challenges, we review ongoing research efforts focused on designing hash functions that are resilient to quantum attacks. We evaluate several promising candidates for post-quantum hash functions, considering their security properties, performance metrics, and practical applicability. The findings of this paper highlight the necessity of transitioning to post-quantum cryptographic solutions to safeguard sensitive information in an increasingly quantum-capable world. Ultimately, we advocate for proactive measures within the cryptographic community to adopt and implement these new standards, thereby ensuring robust data security in the age of quantum computing.

Journal of Intelligent Decision Support System (IDSS)•Jun 30, 2025•0 citations
The advancement of quantum computing poses emerging challenges to cryptographic hash functions that underpin modern cyber defense systems. In particular, Grover’s algorithm theoretically offers a quadratic speedup for preimage search, potentially reducing the effective security margin of hash-based primitives used to protect long-lived strategic data. This study adopts a structure-oriented perspective to analyze ARX-like and sponge-like hash constructions using Grover-based oracle modeling. Reversible toy hash abstractions are employed to construct quantum oracles and simulate Grover attacks under both ideal (noise-free) and Noisy Intermediate-Scale Quantum (NISQ) conditions. The analysis evaluates success probability, oracle cost, and noise sensitivity. Results show non-monotonic amplitude amplification under ideal conditions, with structural differences affecting phase behavior. However, under realistic noise, amplitude amplification is significantly attenuated for both constructions, limiting practical quantum advantage. The findings further show that oracle complexity, reflected in circuit depth and multi-qubit gate usage, plays a dominant role in determining attack feasibility beyond asymptotic complexity reductions. This work provides a structure-level framework for assessing quantum risks to cryptographic hash functions and supports informed post-quantum cyber defense planning.
Grover’s algorithm represents a cornerstone quantum attack against symmetric cryptography, offering a quadratic speedup for exhaustive key search. While its theoretical properties are well established, the practical robustness of Grover’s algorithm under non-ideal oracle execution remains insufficiently quantified, particularly in security-relevant contexts. This work presents a comprehensive quantitative analysis of Grover’s robustness against intermittent oracle failures, modeling realistic execution imperfections that may arise in practical quantum attack scenarios. Using a reduced two-dimensional representation of amplitude amplification, we define and measure a practical reliability threshold beyond which Grover’s success probability collapses abruptly. Our results demonstrate that this threshold decreases exponentially with problem size, scaling as p∗(n)∝2−n/2 p^{\ast}(n) \propto 2^{-n/2} p∗(n)∝2−n/2, implying that cryptographically relevant problem sizes require unrealistically high oracle reliability to preserve quantum advantage. For n=40 n=40 n=40, the oracle must fail less than once every ∼800,000 \sim 800{,}000 ∼800,000 iterations to preserve practical advantage, a requirement that becomes exponentially more stringent for larger key sizes. These findings do not contradict Grover’s theoretical correctness but highlight critical robustness limitations that must be explicitly considered when assessing quantum threats to symmetric cryptography. We provide actionable insights for post-quantum security assessment by translating abstract quantum assumptions into concrete reliability requirements, demonstrating that the practical feasibility of Grover-based attacks may be significantly lower than commonly assumed under realistic hardware constraints.
The rapid advancement of quantum computing presents a fundamental challenge to modern cryptographic security, particularly in the domain of hash functions that ensure data integrity, authentication, and blockchain security. Traditional crypto graphic hash functions such as SHA-256, SHA-3, and BLAKE2 rely on computational hardness assumptions that become obsolete in the presence of large-scale quantum computers. Shor’s algorithm can efficiently break RSA and ECC-based cryptosys tems, while Grover’s algorithm reduces the security of traditional hash functions by square root complexity, significantly weakening their preimage and collision resistance. This quantum threat necessitates the development of post-quantum secure hashing techniques that remain resilient against both classical and quantum adversaries. This paper proposes Quantum Hashing, a novel cryptographic framework that integrates quantum entanglement, lattice-based cryptography, and hybrid quantum classical hashing to construct post-quantum secure hash functions. We introduce a formal model for Quantum Collision Resistance (QCR) and provide entropy-based ran domness enhancement to ensure unpredictable hash outputs. Unlike classical hashing approaches, our framework leverages the hardness of lattice problems (e.g., Shortest Vector Problem, Learning with Errors) to withstand quantum attacks while incorpo rating Quantum Key Distribution (QKD) mechanisms to enhance entropy and key management. Furthermore, we evaluate the security of Quantum Hashing under various attack models, comparing its resistance against Grover’s search and collision attacks. We benchmark its performance against NIST Post-Quantum Cryptography (PQC) final ists, including CRYSTALS-DILITHIUM, SPHINCS+, and Falcon, demonstrating that our approach offers superior resilience while maintaining computational feasibility. Additionally, we present an implementation of Quantum Hashing using Qiskit, show casing its practical applicability in quantum circuits and quantum-secure blockchain architectures. Our findings highlight that Quantum Hashing provides a scalable, entropy-efficient, and post-quantum resilient cryptographic primitive suitable for next-generation cryptographic applications. This work paves the way for secure post-quantum digital signatures, blockchain consensus mechanisms, and zero-knowledge proof systems that require tamper-resistant hashing in a quantum computing era.
Abstract—The emergence of quantum computing represents a fundamental challenge to contemporary cryptographic infras- tructures, mandating immediate adoption of quantum-resistant cryptographic standards to ensure long-term security. This paper analyzes how Shor’s algorithm renders RSA , ECC vulnerable by solving integer factorization and discrete alogarithm problems in polynomial time, while Grover’s algorithm weakens symmetric encryption through quadratic speedup attacks. Through compre- hensive cryptanalysis, we evaluate the vulnerabilities of current public-key infrastructures, symmetric ciphers, and hash functions against quantum threats. Our research systematically examines post-quantum cryptographic candidates, including lattice-based, hash-based, and multivariate polynomial schemes under NIST standardization, assessing their security guarantees and imple- mentation challenges. Furthermore, we investigate the broader implications for secure communications, blockchain networks, and authentication protocols in a post-quantum world. Based on our findings, we propose a practical transition framework featuring hybrid cryptographic systems, protocol enhancements, and policy updates to facilitate seamless migration. This work provides critical insights and actionable strategies for securing digital infrastructure against quantum threats while maintaining operational efficiency during the transition period. Index Terms—Cryptographic vulnerability, Grover’s algo- rithm, Post-quantum cryptography, Quantum computing, Quan- tum key distribution, Shor’s algorithm, Cybersecurity
The advent of quantum computing poses substantial risks to conventional cryptographic mechanisms, particularly hash-based authentication and zero-knowledge identification (ZKI) protocols, which are susceptible to quantum algorithms such as Grover's and Shor's. This study presents a comprehensive benchmarking framework for evaluating the quantum resistance of cryptographic hash functions through performance metrics (execution time, memory utilization), statistical characteristics (entropy, bit-level randomness, avalanche effect), and security attributes (collision and preimage resistance) across diverse input sizes and edge conditions. A novel hybrid hashing strategy, integrating SHA-512 and BLAKE3 in a defense-in-depth configuration, is introduced to enhance post-quantum resilience. Its efficacy is validated via Grover's algorithm simulations, demonstrating a methodology for evaluating the increased computational workload for quantum search algorithms relative to conventional hash functions. The framework incorporates visualization utilities and structured reporting modules, enabling systematic assessment and practical implementation of quantum-resistant cryptographic solutions within ZKI systems. Findings indicate that while classical hashes such as SHA-256 and SHA-512 exhibit theoretically diminished security in quantum threat scenarios, the proposed hybrid method acts as a practical risk mitigation strategy with acceptable computational overhead, providing a viable pathway for safeguarding authentication systems against quantum-capable adversaries.
Abstract In computer science, the Church–Turing thesis has long defined the conceptual boundary of classical computation, asserting that any effectively computable function can be executed by a universal Turing machine. While quantum computing does not invalidate this thesis in terms of computability, it challenges classical assumptions regarding computational efficiency and complexity. With the emergence of quantum computation, the circuit model — built upon logical primitives such as NOT and AND in classical systems — finds its quantum counterpart in reversible and unitary gate structures. Within this framework, Grover’s algorithm represents a fundamental advancement: a quantum algorithm capable of solving unstructured search problems with quadratic speedup compared to classical approaches. This work analyzes the implications of Grover’s algorithm for information security risk assessment, particularly in the context of brute-force attacks and search-based cryptanalysis.
The rapid advancement of quantum computing technology presents a significant challenge to the field of cryptography, particularly affecting the security of hash functions that form the foundation of many cryptographic protocols. Hash functions are widely used to ensure data integrity, generate digital signatures, and securely store passwords. However, the emergence of quantum algorithms—such as Grover’s algorithm—threatens to undermine the security assumptions on which these hash functions are based by significantly reducing their effective security levels. This paper aims to provide a comprehensive analysis of the vulnerabilities introduced by quantum computing to traditional hash functions, detailing how these weaknesses can be exploited by quantum adversaries. We explore the fundamental properties of hash functions, including pre-image resistance, second pre-image resistance, and collision resistance, and assess how these properties are affected in a quantum context. Furthermore, we examine the implications of these vulnerabilities for existing cryptographic systems and emphasize the urgent need for the development of post-quantum cryptographic standards. In response to these challenges, we review ongoing research efforts focused on designing hash functions that are resilient to quantum attacks. We evaluate several promising candidates for post-quantum hash functions, considering their security properties, performance metrics, and practical applicability. The findings of this paper highlight the necessity of transitioning to post-quantum cryptographic solutions to safeguard sensitive information in an increasingly quantum-capable world. Ultimately, we advocate for proactive measures within the cryptographic community to adopt and implement these new standards, thereby ensuring robust data security in the age of quantum computing.