Skip to main content
SpringerLink
Log in

Binary quantum hashing

  • Published:
Russian Mathematics Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ablayev, F. M. “Cryptographic Quantum Hashing”, Laser Physics Letters 11, No. 2, 025202 (2014), http://stacks.iop.org/1612-202X/11/i=2/a=025202.

    Article  MathSciNet  Google Scholar 

  2. Ablayev, F. “Computing Boolean Functions via Quantum Hashing”, in Computing with New Resources, Ed. by C. S. Calude, R. Freivalds, I. Kazuo. Lecture Notes in Computer Science (Springer International Publishing, 2014), 149–160, http://dx.doi.org/10.1007/978-3-319-13350-8_11.

    Google Scholar 

  3. Vasiliev, A. “Quantum Communications Based on Quantum Hashing”, International J. of Appl. Engineering Research 10, No. 12, 31415–31426 (2015).

    Google Scholar 

  4. Gottesman D. “Quantum Digital Signatures”, Tech. Rep. arXiv:quant-ph/0105032, Cornell University Library, Nov. 2001, http://arxiv.org/abs/quant-ph/0105032.

    Google Scholar 

  5. Ablayev, F. “Quantum Hashing via e-Universal Hashing Constructions and Classical Fingerprinting”, Lobachevskii J.Math. 36, No. 2, 89–96 (2015), http://link.springer.com/10.1134/S199508021502002X.

    Article  MathSciNet  MATH  Google Scholar 

  6. Stinson, D. R. “On the Connections Between Universal Hashing, Combinatorial Designs and Error-Correcting Codes”, in Proc. Congressus Numerantium 114, 7–27 (1996).

    MathSciNet  MATH  Google Scholar 

  7. Holevo, A. S. “Some Estimates of the Information Transmitted by Quantum Communication Channel”, Probl. Pered. Inform. 9, No. 3, 3–11 (1973) [in Russian].

    MathSciNet  MATH  Google Scholar 

  8. Ablayev, F. “On the Concept of CryptographicQuantum Hashing”, Laser Physics Letters 12, No. 12, 125204 (2015), http://stacks.iop.org/1612-202X/12/i=12/a=125204.

    Article  Google Scholar 

  9. Naor, J. “Small-Bias Probability Spaces: Effcient Constructions and Applications”, in Proceedings of the twenty second annual ACM symposium on Theory of Computing STOC’90 (New York, NY, USA, ACM, 1990), 213–223, http://doi.acm.org/10.1145/100216.100244.

    Chapter  Google Scholar 

  10. Alon, N., Goldreich, O., Hastad, J., Peralta, R. “Simple Constructions of Almost k-Wise Independent Random Variables”, Random Structures & Algorithms 3, No. 3, 289–304 (1992), http://dx.doi.org/10.1002/rsa.3240030308.

    Article  MathSciNet  MATH  Google Scholar 

  11. Ben-Aroya, A. “Constructing Small-Bias Sets from Algebraic-Geometric Codes”, in Proceedings of 50th Annual IEEE Symposium Foundations of Computer Science FOCS’09 (October 2009), 191–197.

    Chapter  Google Scholar 

  12. Ablayev, F. “On Computational Power of Quantum Branching Programs”, FCT, 59–70 (2001), http://arxiv.org/abs/quant-ph/0302022.

    Google Scholar 

  13. Alon, N. “Random Cayley Graphs and Expanders”, Random Structures & Algorithms 5, No. 2, 271–284 (1994), http://dx.doi.org/10.1002/rsa.3240050203.

    Article  MathSciNet  MATH  Google Scholar 

  14. Buhrman, H., Cleve, R., Watrous, J., de Wolf, R. “Quantum Fingerprinting”, Phys. Rev. Lett. 87, No. 16, 167902 (2001), www.arXiv.org/quant-ph/0102001v1.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kazan (Volga Region) Federal University, ul. Kremlyovskaya 18, Kazan, 420008, Russia

    A. V. Vasiliev

Authors
  1. A. V. Vasiliev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. V. Vasiliev.

Additional information

Original Russian Text © A.V. Vasiliev, 2016, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2016, No. 9, pp. 68–73.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Vasiliev, A.V. Binary quantum hashing. Russ Math. 60, 61–65 (2016). https://doi.org/10.3103/S1066369X16090073

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S1066369X16090073

Keywords

Search

Navigation