Results 181 to 190 of about 1,033,029 (206)
Some of the next articles are maybe not open access.
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
Efficient Algorithms for Quantum Hashing
Lecture Notes in Computer Scienceaccepted to ...
Kamil Khadiev, Ilnar Zinnatullin
exaly +4 more sources
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
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
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
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
Hash Function Based on Quantum Walks
International Journal of Theoretical Physics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, Yu-Guang +4 more
openaire +2 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, Marat Ablayev
exaly +5 more sources
Discrete-time interacting quantum walks and quantum Hash schemes
Quantum Information Processing, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dan Li +5 more
openaire +3 more sources
Quantum cryptanalysis of hash and claw-free functions
ACM SIGACT News, 1997In this note, we give a quantum algorithm that finds collisions in arbitrary τ-to-one functions after only O ( 3 √ N /τ) expected evaluations of the function.
Gilles Brassard +2 more
openaire +1 more source