STUDYING QUANTUM HASHING CRYPTOGRAPHIC STRENGTH
DOI:
https://doi.org/10.32461/2226-3209.3.2018.171831Keywords:
Quantum computing, quantum cryptography, quantum hashing.Abstract
Abstract.This research solves the problem of studying quantum hashing cryptographic strength. The most
important criteria, that should be taken into consideration during cryptographic strength studying, is quantum hashing strength against collisions, and irreversibility of quantum hash-functions. Strength against collisions for selected quantum hash-function depends on many numeric parameters, and it is necessary to find a corresponding optimization solution. It is necessary to conduct comparative analysis of known methods in this research to achieve the goal and offer new methods to deliver the result. In the course of research different algorithms were used and modified to ensure cryptographic strength of quantum hash-functions, and an algorithm on the basis of linear codes is developed to find a
decision in case of high dimensionalities.
Keywords: Quantum computing, quantum cryptography, quantum hashing.
References
Aida Gainutdinova. The fundamentals of quantum computing, 2010
F.M. Ablayev and A.V. Vasiliev. Cryptographic quantum hashing. Laser Physics Letters, 11(2):025202, 2014.
Farid Ablayev and Marat Ablayev. Laser Physics Letters, Volume 12, Number 12 // Laser Physics Letters,
Volume 12, Number 12, 2015 September 2015
F. Ablayev, A. Vasiliev : Algorithms for quantum branching programs based on fingerprinting, Electronic
Proceedings in Theoretical Computer Science, 9:1-11, 2009
Harry Buhrman, Richard Cleve, John Watrous, and Ronald de Wolf. Quantum �ngerprinting. Phys. Rev. Lett.,
(16):167902, Sep 2001. Michael A. Nielsen and Isaac L. Chuang. Quantum Computation and
Michael A. Nielsen and Isaac L. Chuang. Quantum Computation and Quantum Information. Cambridge
University Press, 1 edition, October 2000.
Stinson, D.R. On the connections between universal hashing, combinatorial designs and error-correcting codes
In: Proc. Congressus Numerantium 114, 7–27 (1996).
Kholevo А.S. Some Assessments for Information Quantity Transmitted by Quantum Communication Channel,
Transferring Information Problem. 9 (3), 3–11 (1973).
Ablayev F. On the concept of cryptographic quantum hashing, Laser Physics Letters 12 (12), 125204 (2015),
http://stacks.iop.org/1612-202X/12/i=12/a=125204.
Naor J. Small-bias probability spaces: Effcient constructions and applications, Proceedings of the twenty
Second annual ACM Symposium on Theory of Computing STOC’90 (New York, NY, USA, ACM, 1990),
http://doi.acm.org/10.1145/100216.100244.
Alon N., Goldreich O., Hastad J., Peralta R. Simple constructions of almost k-wise
independent random variables, Random Structures & Algorithms 3 (3), 289–304 (1992),
Kurbanov, R. A., oglu Gurbanov, R. A., Belyalova, A. M., Maksimova, E. V., Leonteva, I. A., & Sharonov, I. A.
(2016). Practical Advice for Teaching of University Students the Mechanisms of Self-Government of Safe Behavior.
International Electronic Journal of Mathematics Education, 12(1), 35-42.
de Paulo Lobato, Christiane Batista, Samanta Borges Pereira, and Flávia Luciana Naves Mafra. "Resistências
àsuperexploração das águas minerais em São Lourenço (MG)." Opción 34.86 (2018): 1043-1076.
Foundations of Computer Science FOCS’09 (Oct. 2009), 191–197.
Ablayev F. On computational power of quantum branching programs, Fundamentals of computation theory
Riga, 2001, 59–70, Lecture Notes in Comput. Sci. (Springer, Berlin, 2001), Vol. 2138.
Downloads
Issue
Section
License
Authors who publish with this journal agree to the following terms:
1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
