Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations

Farid Mansurovich Ablayev, Marat Ablayev, Alexander Vasiliev

Published Jan 1, 2020• 6 citations
Publisher
DOI
10.1007/978-3-030-50026-9_1

Related papers

Security of quantum cryptography and the hash function

Toyohiro Tsurumaru

IEICE Technical Report; IEICE Tech. Rep.•Mar 3, 2016•0 citations

Dual universality of hash functions and its applications to quantum cryptography

豊広 鶴丸, 正人 林

IEICE Technical Report; IEICE Tech. Rep.•Feb 24, 2011•4 citations

Quantum Cryptography and Quantum Computation

John Rarity

European Quantum Electronics Conference (EQEC)•Jan 1, 1996•2 citations

On Quantum Fingerprinting and Quantum Cryptographic Hashing

Farid Mansurovich Ablayev, Marat Ablayev

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, whereas hashing methods are one of the central cryptographical primitives. Fingerprinting and hashing methods are being developed from the mid of the previous century, whereas quantum fingerprinting and quantum hashing have a short history. In this chapter, we investigate quantum fingerprinting and quantum hashing. We present computational aspects of quantum fingerprinting and quantum hashing and discuss cryptographical properties of quantum hashing.

InTech eBooks•May 30, 2018•0 citations

Quantum Cryptography and Quantum Computation

John Rarity

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•Jan 1, 1996•1 citation

Quantum Fingerprinting and Quantum Hashing. Computational and Cryptographical Aspects

Farid Mansurovich Ablayev, Marat Ablayev, Alexander Vasiliev +1 more

Rusins Freivalds was one of the first researchers who introduced methods (later called fingerprinting) for constructing efficient classical randomized and quantum algorithms.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 the central cryptographical primitives.Fingerprinting and hashing methods are being developed from the mid of the previous century, while quantum fingerprinting and quantum hashing have a short history.In the paper we present computational aspects of quantum fingerprinting, discuss cryptographical properties of quantum hashing, and present the possible use of quantum hashing for quantum hash-based message authentication codes.

Baltic Journal of Modern Computing•Dec 19, 2016•24 citations
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, whereas hashing methods are one of the central cryptographical primitives. Fingerprinting and hashing methods are being developed from the mid of the previous century, whereas quantum fingerprinting and quantum hashing have a short history. In this chapter, we investigate quantum fingerprinting and quantum hashing. We present computational aspects of quantum fingerprinting and quantum hashing and discuss cryptographical properties of quantum hashing.
Rusins Freivalds was one of the first researchers who introduced methods (later called fingerprinting) for constructing efficient classical randomized and quantum algorithms.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 the central cryptographical primitives.Fingerprinting and hashing methods are being developed from the mid of the previous century, while quantum fingerprinting and quantum hashing have a short history.In the paper we present computational aspects of quantum fingerprinting, discuss cryptographical properties of quantum hashing, and present the possible use of quantum hashing for quantum hash-based message authentication codes.