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

arXiv:2609.23154

Quantum Hashing with QKD States

A. V. Vasiliev, I. G. Zinnatullin

quant-phSubmitted Sep 19, 2026• Announced Sep 22, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum hashing is a well-known technique. In this paper, we present a new construction of a quantum hash function based on binary error-correcting codes. The construction of the quantum hash strongly resembles the quantum state preparation in QKD protocols (e.g., BB84 protocol) and can be implemented on current QKD-devices.

AI Summary

The paper asks whether quantum hashing can be implemented using the single-qubit states already available in QKD hardware, rather than state preparations requiring more advanced quantum engineering. It constructs a hash from a binary linear $[2k,n,d]$ error-correcting code: an $n$-bit input is encoded into $2k$ classical bits, with one half selecting computational or Hadamard bases and the other selecting basis vectors. The output is a product of $k$ BB84 states. The main general bound is $F(\psi_C)\leq 2^{-\lceil d/2\rceil}$, where $F$ is the maximum squared overlap between outputs for distinct inputs. The proof uses the code’s minimum distance: at least $\lceil d/2\rceil$ qubit positions differ, and each contributes at most $1/2$ to the product fidelity. An explicit code construction starts from a primitive binary BCH code, shortens it on information coordinates, and appends a zero coordinate if needed to obtain even length. For $n=32$ or $n\geq44$, it yields $d\geq2\lceil\log_2 n\rceil+1$, $k=\lceil n/2\rceil+O(\log^2 n)<n$, and $F(\psi_C)\leq1/(2n)$. The stated implementation motivation is that preparation and verification use operations available in existing QKD systems, requiring changes to their classical processing. The paper provides a construction and overlap analysis, not a hardware demonstration or noise analysis. It associates output compression with pre-image resistance but does not derive a separate quantitative pre-image-security bound.

No sign of AI-generated textIncrementalMissing comparisonOverclaims

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Binary quantum hashing

Alexander Vasiliev

We propose a binary quantum hashing technique that allows to present binary inputs by quantum states. We prove the cryptographic properties of the quantum hashing, including its collision resistance and preimage resistance. We also give an efficient quantum algorithm that performs quantum hashing, and altogether this means that this function is quantum one-way. The proposed construction is asymptotically optimal in the number of qubits used.

Russian Mathematics•Jul 21, 2016•5 citations

Constant-Depth Algorithm for Quantum Hashing

Alexander Vasiliev

Abstract Quantum hashing is one of the techniques that allow to construct space-efficient quantum algorithms and protocols. We present a construction that allows to make it extremely time efficient. Our approach is based on the shallow implementation of the quantum fingerprinting technique but uses additional circuit identities specific to the quantum hash function for the cyclic group. The resulting algorithm is equivalent to the one we have implemented earlier using single-photon states with orbital angular momentum encoding.

Russian Microelectronics•Dec 1, 2023•6 citations

On the concept of cryptographic quantum hashing

Farid Mansurovich Ablayev, Marat Ablayev

Abstract In the letter we define the notion of a quantum resistant ( -resistant) hash function which consists of a combination of pre-image (one-way) resistance ( ε -resistance) and collision resistance ( δ -resistance) properties. We present examples and discussion that supports the idea of quantum hashing. We present an explicit quantum hash function which is ‘balanced’, one-way resistant and collision resistant and demonstrate how to build a large family of quantum hash functions. Balanced quantum hash functions need a high degree of entanglement between the qubits. We use a phase transformation technique to express quantum hashing constructions, which is an effective way of mapping hash states to coherent states in a superposition of time-bin modes. The phase transformation technique is ready to be implemented with current optical technology.

arXiv:1509.01268•Laser Physics Letters•Nov 10, 2015•28 citations

QUANTUM KEY DISTRIBUTION SCHEME: AN IMPROVEMENT BASED ON BB84 PROTOCOL

Kausik Saha

Cryptography is being introduced to secure data. Through Classical Cryptographic technique, we can encrypt our data and secure secret key also. But classical cryptography is based on mathematical techniques where reversing one-way function is possible with sufficient computing power and time. So, Quantum Cryptography is introduced to overcome those drawbacks of traditional classical cryptography. It is based on the values of quantum mechanics and photon. Scientists and researchers have brought up a new key distribution protocol based on Quantum Cryptography is called Quantum Key Distribution (QKD) Protocol. The first QKD protocol BB84 was introduced by Charles Bennett and Gilles Brassard in 1984. After that several QKD protocols have been created. In this paper we have improved BB84 Protocol by removing the drawbacks of the existing algorithm towards Eavesdropping which may not be detected or disclosing large portion of secret key. Steps of the existing BB84 algorithm along with the modified one is described in detail with example and pseudo code. Limitations of BB84 and comparative study of both the existing and the improved one based on their security has been made and described in this current work.

International Journal of Advanced Research in Computer Science•Apr 20, 2018•1 citation

Key Distribution using Dual Channel Technique for Ultimate Security

R. Sarath, A. Shajin Nargunam

Background: A new approach for the implementation of Quantum Cryptography is proposed in this paper. Quantum Cryptography has practicalweakness like lack of authentication, single photon generation and many realtime implementation problems.Thispaper also explainshowthedrawback ofBB84protocolis eliminatedby combiningClassicalCryptography and Quantum techniques. Methods: We analyze the usage ofDual Channel Interferometer technique and thereby fusing Quantum techniqueswith classicaltechnique.And their combination resultin the feasibility of authentication, and hacker identification, thereby introducing a novel method of QKD transmission. A quantum digital authentication scheme based on hash function is proposedinthispaper .The securityofthequantumprotocolliesonthe existenceofquantumonewayfunctionbyfundamental quantum principle. The practical difficulties in quantum control and quantum computation made quantum protocol hard to implement. The lack of authentication made the quantum protocol vulnerable to hackers. Introducing two level quantum system authentications can be achieved with the help of hash function. To guarantee the authenticity, hash codes are split into two parts and exchange of code is made through two quantum channels.This scheme uses a programmable polarizer ensuring the quantum one way function and removing the practical difficulties of quantum control and quantum computation. The proposed scheme presents a novel method to construct secure quantum authentication for future communication. Result: Dual channel implementation helps in implementing authentication in quantum BB84 protocol. We combined the advantages of quantum techniques and classical techniques and tried to implement a novel technique to ensure secure communication. Application: People use the ATM for transactions such as cash withdrawal, money transfer and payment of electricity and telephone bills. ATM is the most convenient to access the accounts and funding transactions. Personal Identification Number (PIN)is an important aspect of the current ATM system in providing security and it is a commonly used method in protecting the transaction of one’s account.By implementing above technique ATM pin transfer can be successfully made.Keyword: BB84, Classical Cryptography,Hash Codes,Hash Function, Quantum Channels Programmable Polarizer, Quantum Cryptography

Indian Journal of Science and Technology•Oct 13, 2015•0 citations

Advanced Secure Communication: Exploring Quantum Key Distribution, the BB84 Method

Badukuri Hemalatha, Badukuri Premalatha, B. Reddaiah

One promising way to use quantum information to secure everyday communication is through the distribution of quantum keys. By exchanging a secret key, the Quantum Key Distribution (QKD) approach allows two parties to communicate securely.BB84 protocol is among the most well-known QKD protocols. In this protocol, qubits are exchanged via a quantum channel between the sender and the receiver. This enables them to produce a shared key that is impenetrable to eavesdroppers and illustrate the fundamental ideas of QKD using current simulations and implementations. The results of this study demonstrate that the BB84 protocol is a highly secure QKD technique that has been investigated in great detail and used in a variety of contexts. Additionally, over the enhancements made to the BB84 protocol such as the use of advanced error correction techniques and decoy states to increase its security and usability is discussed. With an emphasis on the BB84 protocol in secure communication technologies, this study offers an extensive analysis of QKD systems overall.

International Journal of Engineering and Advanced Technology•Apr 21, 2024•1 citation
The paper asks whether quantum hashing can be implemented using the single-qubit states already available in QKD hardware, rather than state preparations requiring more advanced quantum engineering. It constructs a hash from a binary linear [2k,n,d][2k,n,d][2k,n,d] error-correcting code: an nnn-bit input is encoded into 2k2k2k classical bits, with one half selecting computational or Hadamard bases and the other selecting basis vectors. The output is a product of kkk BB84 states.
The main general bound is F(ψC)≤2−⌈d/2⌉F(\psi_C)\leq 2^{-\lceil d/2\rceil}F(ψC​)≤2−⌈d/2⌉, where FFF is the maximum squared overlap between outputs for distinct inputs. The proof uses the code’s minimum distance: at least ⌈d/2⌉\lceil d/2\rceil⌈d/2⌉ qubit positions differ, and each contributes at most 1/21/21/2 to the product fidelity.
An explicit code construction starts from a primitive binary BCH code, shortens it on information coordinates, and appends a zero coordinate if needed to obtain even length. For n=32n=32n=32 or n≥44n\geq44n≥44, it yields d≥2⌈log⁡2n⌉+1d\geq2\lceil\log_2 n\rceil+1d≥2⌈log2​n⌉+1, k=⌈n/2⌉+O(log⁡2n)<nk=\lceil n/2\rceil+O(\log^2 n)<nk=⌈n/2⌉+O(log2n)<n, and F(ψC)≤1/(2n)F(\psi_C)\leq1/(2n)F(ψC​)≤1/(2n).
The stated implementation motivation is that preparation and verification use operations available in existing QKD systems, requiring changes to their classical processing. The paper provides a construction and overlap analysis, not a hardware demonstration or noise analysis. It associates output compression with pre-image resistance but does not derive a separate quantitative pre-image-security bound.
Abstract Quantum hashing is one of the techniques that allow to construct space-efficient quantum algorithms and protocols. We present a construction that allows to make it extremely time efficient. Our approach is based on the shallow implementation of the quantum fingerprinting technique but uses additional circuit identities specific to the quantum hash function for the cyclic group. The resulting algorithm is equivalent to the one we have implemented earlier using single-photon states with orbital angular momentum encoding.
Abstract In the letter we define the notion of a quantum resistant ( -resistant) hash function which consists of a combination of pre-image (one-way) resistance ( ε -resistance) and collision resistance ( δ -resistance) properties. We present examples and discussion that supports the idea of quantum hashing. We present an explicit quantum hash function which is ‘balanced’, one-way resistant and collision resistant and demonstrate how to build a large family of quantum hash functions. Balanced quantum hash functions need a high degree of entanglement between the qubits. We use a phase transformation technique to express quantum hashing constructions, which is an effective way of mapping hash states to coherent states in a superposition of time-bin modes. The phase transformation technique is ready to be implemented with current optical technology.
Cryptography is being introduced to secure data. Through Classical Cryptographic technique, we can encrypt our data and secure secret key also. But classical cryptography is based on mathematical techniques where reversing one-way function is possible with sufficient computing power and time. So, Quantum Cryptography is introduced to overcome those drawbacks of traditional classical cryptography. It is based on the values of quantum mechanics and photon. Scientists and researchers have brought up a new key distribution protocol based on Quantum Cryptography is called Quantum Key Distribution (QKD) Protocol. The first QKD protocol BB84 was introduced by Charles Bennett and Gilles Brassard in 1984. After that several QKD protocols have been created. In this paper we have improved BB84 Protocol by removing the drawbacks of the existing algorithm towards Eavesdropping which may not be detected or disclosing large portion of secret key. Steps of the existing BB84 algorithm along with the modified one is described in detail with example and pseudo code. Limitations of BB84 and comparative study of both the existing and the improved one based on their security has been made and described in this current work.
Background: A new approach for the implementation of Quantum Cryptography is proposed in this paper. Quantum Cryptography has practicalweakness like lack of authentication, single photon generation and many realtime implementation problems.Thispaper also explainshowthedrawback ofBB84protocolis eliminatedby combiningClassicalCryptography and Quantum techniques. Methods: We analyze the usage ofDual Channel Interferometer technique and thereby fusing Quantum techniqueswith classicaltechnique.And their combination resultin the feasibility of authentication, and hacker identification, thereby introducing a novel method of QKD transmission. A quantum digital authentication scheme based on hash function is proposedinthispaper .The securityofthequantumprotocolliesonthe existenceofquantumonewayfunctionbyfundamental quantum principle. The practical difficulties in quantum control and quantum computation made quantum protocol hard to implement. The lack of authentication made the quantum protocol vulnerable to hackers. Introducing two level quantum system authentications can be achieved with the help of hash function. To guarantee the authenticity, hash codes are split into two parts and exchange of code is made through two quantum channels.This scheme uses a programmable polarizer ensuring the quantum one way function and removing the practical difficulties of quantum control and quantum computation. The proposed scheme presents a novel method to construct secure quantum authentication for future communication. Result: Dual channel implementation helps in implementing authentication in quantum BB84 protocol. We combined the advantages of quantum techniques and classical techniques and tried to implement a novel technique to ensure secure communication. Application: People use the ATM for transactions such as cash withdrawal, money transfer and payment of electricity and telephone bills. ATM is the most convenient to access the accounts and funding transactions. Personal Identification Number (PIN)is an important aspect of the current ATM system in providing security and it is a commonly used method in protecting the transaction of one’s account.By implementing above technique ATM pin transfer can be successfully made.Keyword: BB84, Classical Cryptography,Hash Codes,Hash Function, Quantum Channels Programmable Polarizer, Quantum Cryptography
One promising way to use quantum information to secure everyday communication is through the distribution of quantum keys. By exchanging a secret key, the Quantum Key Distribution (QKD) approach allows two parties to communicate securely.BB84 protocol is among the most well-known QKD protocols. In this protocol, qubits are exchanged via a quantum channel between the sender and the receiver. This enables them to produce a shared key that is impenetrable to eavesdroppers and illustrate the fundamental ideas of QKD using current simulations and implementations. The results of this study demonstrate that the BB84 protocol is a highly secure QKD technique that has been investigated in great detail and used in a variety of contexts. Additionally, over the enhancements made to the BB84 protocol such as the use of advanced error correction techniques and decoy states to increase its security and usability is discussed. With an emphasis on the BB84 protocol in secure communication technologies, this study offers an extensive analysis of QKD systems overall.