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

Applied Mechanics and Materials

Quantum Fuzzy Classification Hashing Algorithm with the One-Time Pad Security Properties

Dong Cao

Published Dec 1, 2014• 1 citation
Publisher

Abstract

We propose a new method of quantum fuzzy classification hashing scheme constructed from the method of quantum information processing. Based on the uniform random fuzziness of the template set produced by the quantum fuzzy classification hashing, Security of the identification scheme is equivalent to one-time pad. Compared to the construction schemes based on similar method, the novel quantum fuzzy classification hashing scheme has a more simplified structure. Our algorithms have outstanding data security and validity. Theoretical analysis shows that the quantum fuzzy classification hashing can effectively resist the attack of quantum computation.

DOI
10.4028/www.scientific.net/amm.701-702.1102

Related papers

Biometric authentication constructed from quantum entropy distribution fuzzy hash

Dong Cao, Yaoliang Song

In this paper, we propose a novel construction method of biometric authentication algorithm based on quantum entropy distribution fuzzy hash. Utilizing the special attributes of normalized quantum information entropy, the quantum fuzzy hash is combined with the distribution architecture of quantum data sequence, and can extract the maximum common feature of quantum information exist in these homologous data files. Based on the degree of difference in these hash values, the proposed quantum entropy distribution fuzzy hash algorithms can efficiently identify similarity quantum data files. The novel quantum entropy distribution fuzzy hash is constituted by quantum algorithm, and the corresponding biometric authentication algorithm solved the problem that classical similar algorithms cannot efficiently resist the attack of quantum Turing machine. Theoretical analysis proves that the securities of the proposed schemes are satisfying conditions of the information security and access control validity.

•Oct 1, 2014•2 citations

A TYPE OF POST–QUANTUM CRYPTOGRAPHIC ALGORITHM

Hong Dung Luu

The article proposes a type of post–quantum cryptographic algorithm based on hash function and One–Time Pad cipher. Due to inheriting a property called “perfect secrecy” of the One-Time Pad cipher, the algorithms constructed according to the method proposed here can resist various types of attacks with the help of quantum computers. In addition to high security, algorithms of this type also have the ability to authenticate the origin and integrity of the encrypted messages. On the other hand, the one-time key for encryption/decryption is established for each individual message while the management and distribution of the shared secret key between the sender/encryptor and receiver/decryptor is performed similar to symmetric – key cryptosystems being applied in practice.

Journal of Science and Technique•Jun 28, 2024•2 citations

Quantum Fuzzy Commitment and Biometric Authentication Scheme Based on Entanglement-Assisted Quantum Error-Correcting Codes

Song Yao-liang

Fuzzy commitment based on classical cryptographic algorithms can not resist the attack of quantum algorithms.This paper presents a quantum fuzzy commitment by using entanglement-assisted quantum error correcting codes and quantum hash.Fuzzy commitment set can be constructed from the codes space of the entanglement-assisted quantum error-correcting codes,and the quantum codes need not satisfy the requirement of self-dual constraint.In commitment phase,the code word is transformed based on commitment witness.The information process can resist quantum Fourier sampling attack.Then,we present a quantum hash algorithm.The random qubits are adjusted with diffusion and confusion,and then encrypted by using the random secret key.The security of the process is same as the one-time pad.The proposed scheme can resist the attack of quantum Turing machines.Based on the quantum fuzzy commitment,this paper also gives a quantum challenge-response biometric authentication scheme.Theoretical analysis shows that our protocol has good security and validity.

Dianzi xuebao•Jan 1, 2012•0 citations

Quantum identification based on one-time pad

Pan Jiang

We propose a quantum identification scheme.The scheme uses one-time random strings to hide the key shared by both sides,and the verification algorithm is independent of the random strings.So it protects the key.The scheme is secure even if the adversary has unlimited resource of computation.

Journal of the Graduate School of the Chinese Academy of Sciences•Jan 1, 2012•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

Continuous-time quantum hash function based on one-dimensional cycle lattice

Wei‐Min Shi, Wang Shou, Pan Tian +2 more

The proposed quantum hash function (QHF) based on the discrete-time quantum walk (DTQW) structure requires enlarging the coin state space and the preparation of continuous quantum states is less difficult. Hence, a new construction method of QHF is proposed based on the continuous-time quantum walk (CTQW) of the one-dimensional (1D) lattice with boundary constraints and without additional coin space. In the scheme, the input of the QHF is an arbitrary binary string message which is used to control the selected Hamiltonian of CTQW at each time interval, and the output of the QHF is the final probability distribution of CTQW. Under the same computing environment, simulation and analysis indicate that our QHF can satisfy the same security requirements such as sensitivity, diffusion and confusion, collision, birthday attack, but the collision rate is reduced by 40% without reducing effectiveness.

Modern Physics Letters B•Jun 17, 2022•5 citations
We propose a new method of quantum fuzzy classification hashing scheme constructed from the method of quantum information processing. Based on the uniform random fuzziness of the template set produced by the quantum fuzzy classification hashing, Security of the identification scheme is equivalent to one-time pad. Compared to the construction schemes based on similar method, the novel quantum fuzzy classification hashing scheme has a more simplified structure. Our algorithms have outstanding data security and validity. Theoretical analysis shows that the quantum fuzzy classification hashing can effectively resist the attack of quantum computation.
In this paper, we propose a novel construction method of biometric authentication algorithm based on quantum entropy distribution fuzzy hash. Utilizing the special attributes of normalized quantum information entropy, the quantum fuzzy hash is combined with the distribution architecture of quantum data sequence, and can extract the maximum common feature of quantum information exist in these homologous data files. Based on the degree of difference in these hash values, the proposed quantum entropy distribution fuzzy hash algorithms can efficiently identify similarity quantum data files. The novel quantum entropy distribution fuzzy hash is constituted by quantum algorithm, and the corresponding biometric authentication algorithm solved the problem that classical similar algorithms cannot efficiently resist the attack of quantum Turing machine. Theoretical analysis proves that the securities of the proposed schemes are satisfying conditions of the information security and access control validity.
The article proposes a type of post–quantum cryptographic algorithm based on hash function and One–Time Pad cipher. Due to inheriting a property called “perfect secrecy” of the One-Time Pad cipher, the algorithms constructed according to the method proposed here can resist various types of attacks with the help of quantum computers. In addition to high security, algorithms of this type also have the ability to authenticate the origin and integrity of the encrypted messages. On the other hand, the one-time key for encryption/decryption is established for each individual message while the management and distribution of the shared secret key between the sender/encryptor and receiver/decryptor is performed similar to symmetric – key cryptosystems being applied in practice.
Fuzzy commitment based on classical cryptographic algorithms can not resist the attack of quantum algorithms.This paper presents a quantum fuzzy commitment by using entanglement-assisted quantum error correcting codes and quantum hash.Fuzzy commitment set can be constructed from the codes space of the entanglement-assisted quantum error-correcting codes,and the quantum codes need not satisfy the requirement of self-dual constraint.In commitment phase,the code word is transformed based on commitment witness.The information process can resist quantum Fourier sampling attack.Then,we present a quantum hash algorithm.The random qubits are adjusted with diffusion and confusion,and then encrypted by using the random secret key.The security of the process is same as the one-time pad.The proposed scheme can resist the attack of quantum Turing machines.Based on the quantum fuzzy commitment,this paper also gives a quantum challenge-response biometric authentication scheme.Theoretical analysis shows that our protocol has good security and validity.
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.
The proposed quantum hash function (QHF) based on the discrete-time quantum walk (DTQW) structure requires enlarging the coin state space and the preparation of continuous quantum states is less difficult. Hence, a new construction method of QHF is proposed based on the continuous-time quantum walk (CTQW) of the one-dimensional (1D) lattice with boundary constraints and without additional coin space. In the scheme, the input of the QHF is an arbitrary binary string message which is used to control the selected Hamiltonian of CTQW at each time interval, and the output of the QHF is the final probability distribution of CTQW. Under the same computing environment, simulation and analysis indicate that our QHF can satisfy the same security requirements such as sensitivity, diffusion and confusion, collision, birthday attack, but the collision rate is reduced by 40% without reducing effectiveness.