Quantum Lifting for Invertible Permutations and Ideal Ciphers
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917999012741120 |
|---|---|
| author | Cojocaru, Alexandru Hhan, Minki Liu, Qipeng Yamakawa, Takashi Yun, Aaram |
| author_facet | Cojocaru, Alexandru Hhan, Minki Liu, Qipeng Yamakawa, Takashi Yun, Aaram |
| contents | In this work, we derive the first lifting theorems for establishing security in the quantum random permutation and ideal cipher models. These theorems relate the success probability of an arbitrary quantum adversary to that of a classical algorithm making only a small number of classical queries.
By applying these lifting theorems, we improve previous results and obtain new quantum query complexity bounds and post-quantum security results. Notably, we derive tight bounds for the quantum hardness of the double-sided zero search game and establish the post-quantum security for the preimage resistance, one-wayness, and multi-collision resistance of constant-round sponge, as well as the collision resistance of the Davies-Meyer construction. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_18188 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum Lifting for Invertible Permutations and Ideal Ciphers Cojocaru, Alexandru Hhan, Minki Liu, Qipeng Yamakawa, Takashi Yun, Aaram Quantum Physics Computational Complexity Cryptography and Security In this work, we derive the first lifting theorems for establishing security in the quantum random permutation and ideal cipher models. These theorems relate the success probability of an arbitrary quantum adversary to that of a classical algorithm making only a small number of classical queries. By applying these lifting theorems, we improve previous results and obtain new quantum query complexity bounds and post-quantum security results. Notably, we derive tight bounds for the quantum hardness of the double-sided zero search game and establish the post-quantum security for the preimage resistance, one-wayness, and multi-collision resistance of constant-round sponge, as well as the collision resistance of the Davies-Meyer construction. |
| title | Quantum Lifting for Invertible Permutations and Ideal Ciphers |
| topic | Quantum Physics Computational Complexity Cryptography and Security |
| url | https://arxiv.org/abs/2504.18188 |