Cryptographic properties of the quantum hashing based on expander graphs
From MaRDI portal
Recommendations
Cites work
- A Pseudorandom Generator from any One-way Function
- A single quantum cannot be cloned
- Expander graphs and their applications
- From graphs to keyed quantum hash functions
- scientific article; zbMATH DE number 3497764 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 2061729 (Why is no real title available?)
- ONE-TIME PAD CRYPTOGRAPHY
- Quantum cryptography: public key distribution and coin tossing
- Quantum hashing for finite abelian groups
- Quantum hashing via \(\epsilon\)-universal hashing constructions and classical fingerprinting
- Quantum hashing. Group approach
- Quantum theory: concepts and methods
Cited in
(2)
This page was built for publication: Cryptographic properties of the quantum hashing based on expander graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6043939)