Results 171 to 180 of about 1,019 (197)
Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations
, 2020 Fingerprinting and cryptographic hashing have quite different usages in computer science, but have similar properties. Interpretation of their properties is determined by the area of their usage: fingerprinting methods are methods for constructing efficient randomized and quantum algorithms for computational problems, while hashing methods are one of ...
Farid M. Ablayev +2 more
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Quantum hashing via ∈-universal hashing constructions and classical fingerprinting
Lobachevskii Journal of Mathematics, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Farid Ablayev, Marat Ablayev
exaly +4 more sources
Quantum Hashing via ε-Universal Hashing Constructions and Freivalds’ Fingerprinting Schemas
Lecture Notes in Computer Science, 2014We define the concept of a quantum hash generator and offer a design, which allows one to build a large number of different quantum hash functions. The construction is based on composition of a classical ε-universal hash family and a given family of functions - quantum hash generators.
Farid Ablayev +2 more
exaly +4 more sources
Computing Boolean Functions via Quantum Hashing [PDF]
, 2014 © Springer International Publishing Switzerland 2014. In this paper we show a computational aspect of the quantum hashing technique. In particular we apply it for computing Boolean functions in the model of read-once quantum branching programs based on the properties of specific polynomial presentation of those functions.
Farid M. Ablayev, Alexander Vasiliev
openaire +4 more sources
Minimizing collisions for quantum hashing [PDF]
, 2017 © Medwell Journals, 2017.Hashing is a widely used technique in computer science. The recently proposed quantum hashing has also proved its usefulness in a number of applications. The key property of both classical and quantum hashing is the ability to withstand collisions however, the notion of collision itself is different in the classical and quantum
Vasiliev A., Latypov M., Ziatdinov M.
openaire +3 more sources
Quantum hashing via single-photon states with orbital angular momentum
Physical Review A, 2021 Quantum hashing is a promising generalization of the cryptographic hashing concept on the quantum domain. In this paper, we construct a quantum hash via a sequence of single-photon states and perform a proof-of-principle experiment using orbital angular ...
D A Turaykhanov +2 more
exaly +1 more source
Proceedings of Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications", 2022
In this paper, we show the possible development of the technique of quantum hashing, which brings it closer to practical implementation, namely we propose a modified version of the quantum hash function, using the structure of one-photon multidimensional quantum states in basis of the orbital angular momentum.
Farid Mansurovich Ablaev +1 more
openaire +1 more source
In this paper, we show the possible development of the technique of quantum hashing, which brings it closer to practical implementation, namely we propose a modified version of the quantum hash function, using the structure of one-photon multidimensional quantum states in basis of the orbital angular momentum.
Farid Mansurovich Ablaev +1 more
openaire +1 more source
On quantum (δ, є)-resistant hashing [PDF]
Lobachevskii Journal of Mathematics, 2016 © 2016, Pleiades Publishing, Ltd.In the paper we define a notion of quantum resistant ((δ, є)-resistant) hash function which combine together a notion of pre-image (one-way) resistance (δ-resistance) property and the notion of collision resistance (є ...
Marat Ablayev
exaly +1 more source
Identification of Quantum Hashes: Numerical Experiment
Lobachevskii Journal of Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ablayev, F. M., Ziatdinov, M. T.
openaire +2 more sources
Laser Physics Letters, 2013
We present a version of quantum hash functions based on non-binary discrete functions. The proposed quantum procedure is 'classical-quantum', that is, it takes a classical bit string as an input and produces a quantum state. The resulting function has the property of a one-way function (pre-image resistance); in addition it has properties analogous to ...
Ablayev F., Vasiliev A.
openaire +3 more sources
We present a version of quantum hash functions based on non-binary discrete functions. The proposed quantum procedure is 'classical-quantum', that is, it takes a classical bit string as an input and produces a quantum state. The resulting function has the property of a one-way function (pre-image resistance); in addition it has properties analogous to ...
Ablayev F., Vasiliev A.
openaire +3 more sources