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

Lecture notes in networks and systems

New Post-quantum Crypto-algorithm Utilizing Hash Function: Applicable in Blockchain

Namita Tiwari, Shashank Dwivedi, Sonika Singh

Published Oct 14, 2024• 0 citations
Publisher
DOI
10.1007/978-981-97-4152-6_39

Related papers

A Quantum-Resistant Blockchain Based on Hash Functions

Ying Chen, Haoshu Lan, Runchun Fan +2 more

Communications in computer and information science•Jan 1, 2024•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

Advancement in Blockchain Using Post-quantum Cryptography

Parth Mittal, Shubham Singh Shubham Singh, Abhishek Kumar Pathak +1 more

Springer eBooks•Jan 1, 2026•0 citations

Enhancing blockchain security against quantum threats through integration of post-quantum cryptographic algorithms

Revathi K, Suganthi K

Computers & Electrical Engineering•Aug 6, 2025•16 citations

Blockchain-Based Key State Management for IoT Devices in Post-Quantum Era

Vincent Lew Kok Seng, Au Thien Wan, S. H. Shah Newaz +1 more

Blockchain has been paving the way for new business opportunities as we have witnessed over the last few years. It will continue to proliferate further and be adopted in increasingly diverse sectors. One area of research in Blockchain is how it can be used in Internet of Things (IoT) based applications like Unmanned Aerial Vehicles (UAV), Smart cities and Healthcare. However, with the advent of quantum technology, some widely used security algorithms in blockchain are vulnerable (i.e., quantum algorithms can exponentially solve cryptographic algorithms used to digitally sign or encrypt data), thereby diminishing communication security. Thus, post-quantum algorithms are at the forefront of research to secure data before quantum technologies can fully mature. Early standardized post-quantum algorithms such as hash-based one-time signatures, relies on the proven one-way-ness of hashing algorithm. Hash-based one-time signatures require robust secret key management systems to prevent security degradation. To safeguard IoT applications from quantum threats, this paper proposes a solution which utilizes both hash-based one-time signatures and blockchain to cover each technology's weaknesses.

IEEE International Conference on Consumer Electronics-Asia (ICCE-Asia)•Nov 3, 2024•0 citations

Post‐Quantum Cryptosystems for Blockchain

K. Tamil Selvi, R. Thamilselvan

Blockchain with its inherent characteristics like transparency, accountability, and reliability finds its place in numerous applications. These characteristics are enabled through hash functions and public key cryptography. However, these hash functions and public key cryptography are non-resistance to quantum attacks. This leads to the rise of post-quantum cryptosystem for distributed ledger technologies like blockchain. The post-quantum cryptosystem can be modeled through public key post-quantum cryptosystems and post-quantum signing algorithms. Many variants of public key–based systems are code-based, multivariate-based, and lattice-based cryptosystems. Signing algorithms can be implemented as code-based or hash-based. Post-quantum blockchains are derived from quantum-resistant blockchain cryptography which are immune to Grover's and Shor's algorithm-based security attacks. Further secured blockchain transaction can be implemented using quantum key distribution (QKD) through secured key exchange. QKD can support one-time pad (OTP) generation, which is a large single key pre-shared between sender and receiver. This OTP can be generated using quantum random number generation. Hybrid post-cryptosystem that combines pre-quantum and post-quantum cryptosystem aims to protect the transactions of blockchain from quantum attacks. Although this system is secure, there is a complementation between security, resource consumption, and high complex of computation. The compression mechanisms can be employed to reduce the data transmission overhead. Thus, most relevant post-quantum blockchain system can be built based on applications requirements and security constraints.

Wiley eBooks•Jul 15, 2022•3 citations
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.
Blockchain has been paving the way for new business opportunities as we have witnessed over the last few years. It will continue to proliferate further and be adopted in increasingly diverse sectors. One area of research in Blockchain is how it can be used in Internet of Things (IoT) based applications like Unmanned Aerial Vehicles (UAV), Smart cities and Healthcare. However, with the advent of quantum technology, some widely used security algorithms in blockchain are vulnerable (i.e., quantum algorithms can exponentially solve cryptographic algorithms used to digitally sign or encrypt data), thereby diminishing communication security. Thus, post-quantum algorithms are at the forefront of research to secure data before quantum technologies can fully mature. Early standardized post-quantum algorithms such as hash-based one-time signatures, relies on the proven one-way-ness of hashing algorithm. Hash-based one-time signatures require robust secret key management systems to prevent security degradation. To safeguard IoT applications from quantum threats, this paper proposes a solution which utilizes both hash-based one-time signatures and blockchain to cover each technology's weaknesses.
Blockchain with its inherent characteristics like transparency, accountability, and reliability finds its place in numerous applications. These characteristics are enabled through hash functions and public key cryptography. However, these hash functions and public key cryptography are non-resistance to quantum attacks. This leads to the rise of post-quantum cryptosystem for distributed ledger technologies like blockchain. The post-quantum cryptosystem can be modeled through public key post-quantum cryptosystems and post-quantum signing algorithms. Many variants of public key–based systems are code-based, multivariate-based, and lattice-based cryptosystems. Signing algorithms can be implemented as code-based or hash-based. Post-quantum blockchains are derived from quantum-resistant blockchain cryptography which are immune to Grover's and Shor's algorithm-based security attacks. Further secured blockchain transaction can be implemented using quantum key distribution (QKD) through secured key exchange. QKD can support one-time pad (OTP) generation, which is a large single key pre-shared between sender and receiver. This OTP can be generated using quantum random number generation. Hybrid post-cryptosystem that combines pre-quantum and post-quantum cryptosystem aims to protect the transactions of blockchain from quantum attacks. Although this system is secure, there is a complementation between security, resource consumption, and high complex of computation. The compression mechanisms can be employed to reduce the data transmission overhead. Thus, most relevant post-quantum blockchain system can be built based on applications requirements and security constraints.