Pages that link to "Item:Q2944885"
From MaRDI portal
The following pages link to Computing Boolean Functions via Quantum Hashing (Q2944885):
Displaying 14 items.
- Binary quantum hashing (Q327965) (← links)
- Efficient branching programs for quantum hash functions generated by small-biased sets (Q1992102) (← links)
- Attacking quantum hashing. Protocols and their cryptanalysis (Q1992117) (← links)
- Constructing quantum hash functions based on quantum walks on Johnson graphs (Q1993776) (← links)
- Quantum to classical one-way function and its applications in quantum money authentication (Q1993848) (← links)
- Analysis of properties of quantum hashing (Q2331334) (← links)
- Quantum hashing for finite abelian groups (Q2361681) (← links)
- On quantum \((\delta,\varepsilon)\)-resistant hashing (Q2361682) (← links)
- Quantum computer with atomic logical qubits encoded on macroscopic three-level systems in common quantum electrodynamic cavity (Q2442487) (← links)
- Computing Boolean Functions via Quantum Hashing (Q2944885) (← links)
- Минимизация коллизий при квантовом хешировании (Q3381820) (← links)
- Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations (Q5042223) (← links)
- О понятии квантового хеширования (Q5152418) (← links)
- Dynamic full quantum one-way function based on quantum circuit mapping (Q6073993) (← links)
