Quantum hash function using discrete-time quantum walk on Hanoi network
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917317219188736 |
|---|---|
| author | Giri, Pulak Ranjan |
| author_facet | Giri, Pulak Ranjan |
| contents | Quantum walk based hash functions have attracted a lot of attention in recent years because of its faster execution time and robust resistance against attacks compared to classical hash functions. It has been observed that the underlying graph and the way message controls the quantum walk iteration steps play a crucial role for the robustness of the hash function. We propose a quantum hash function based on the discrete-time quantum walk on a Hanoi network--a one dimensional periodic lattice with extra long-range edges of a specific form--which is highly collision resistant. The message bits of our scheme control the flow of probability amplitude through the extra long-range edges and the conditional shift operators. Our method even works for messages with small bit-lengths, contrary to most of the quantum walk based hash functions defined on a cycle, which usually work for messages with bit-lengths more than the length of the cycle. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_18271 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum hash function using discrete-time quantum walk on Hanoi network Giri, Pulak Ranjan Quantum Physics Quantum walk based hash functions have attracted a lot of attention in recent years because of its faster execution time and robust resistance against attacks compared to classical hash functions. It has been observed that the underlying graph and the way message controls the quantum walk iteration steps play a crucial role for the robustness of the hash function. We propose a quantum hash function based on the discrete-time quantum walk on a Hanoi network--a one dimensional periodic lattice with extra long-range edges of a specific form--which is highly collision resistant. The message bits of our scheme control the flow of probability amplitude through the extra long-range edges and the conditional shift operators. Our method even works for messages with small bit-lengths, contrary to most of the quantum walk based hash functions defined on a cycle, which usually work for messages with bit-lengths more than the length of the cycle. |
| title | Quantum hash function using discrete-time quantum walk on Hanoi network |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2512.18271 |