Results 1 to 10 of about 1,492,941 (204)
Hybrid Classical–Quantum Text Search Based on Hashing [PDF]
The paper considers the problem of finding a given substring in a text. It is known that the complexity of a classical search query in an unordered database is linear in the length of the text and a given substring.
Farid Ablayev +2 more
doaj +2 more sources
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
F. Ablaev, A. Vasiliev
semanticscholar +2 more sources
Quantum Hashing. Group approach [PDF]
In this paper we consider a generalization of quantum hash functions for arbitrary groups. We show that quantum hash function exists for arbitrary abelian group. We construct a set of “good” automorphisms—a key component of quantum hash funciton.
M. Ziatdinov
semanticscholar +6 more sources
Theory and Applications of Quantum Hashing
We review recent results on quantum one-way functions, including quantum fingerprinting or quantum hashing (we use these two terms as synonyms even though they have very small difference).
Farid Ablayev +3 more
doaj +2 more sources
Quantum hashing for finite abelian groups [PDF]
We propose a generalization of the quantum hashing technique based on the notion of small-bias sets. These sets have proved useful in different areas of computer science, and here their properties give an optimal construction for succinct quantum ...
A. Vasiliev
semanticscholar +7 more sources
Near-Hashing-Bound Multiple-Rate Quantum Turbo Short-Block Codes [PDF]
Quantum stabilizer codes (QSCs) suffer from a low quantum coding rate since they have to recover the quantum bits (qubits) in the face of both bit-flip and phase-flip errors. In this treatise, we conceive a low-complexity concatenated quantum turbo code (
Daryus Chandra +3 more
doaj +2 more sources
Classical and Quantum Meet-in-the-Middle Nostradamus Attacks on AES-like Hashing
At EUROCRYPT 2006, Kelsey and Kohno proposed the so-called chosen target forced-prefix (CTFP) preimage attack, where for any challenge prefix P, the attacker can generate a suffix S such that H(P∥S) = y for some hash value y published in advance by the ...
Zhiyu Zhang +3 more
doaj +2 more sources
Universal hash functions from quantum procedures
Modern quantum technologies are NISQ (Noisy Intermediate-Scale Quantum) devices, which are used to create insufficiently accurate quantum computers with low computing power.
F.M. Ablayev, M.T. Ziatdinov
doaj +2 more sources
A hybrid hash framework for post quantum secure zero knowledge identification [PDF]
The advent of quantum computing poses substantial risks to conventional cryptographic mechanisms, particularly hash-based authentication and zero-knowledge identification (ZKI) protocols, which are susceptible to quantum algorithms such as Grover’s and ...
Samarth Bhadane +3 more
doaj +2 more sources
Quantum Free-Start Collision Attacks on Double Block Length Hashing with Round-Reduced AES-256
Recently, Hosoyamada and Sasaki (EUROCRYPT 2020), and Xiaoyang Dong et al. (ASIACRYPT 2020) proposed quantum collision attacks against AES-like hashing modes AES-MMO and AES-MP.
Amit Kumar Chauhan +2 more
doaj +2 more sources

