Paper 2025/738

Quantum Lifting for Invertible Permutations and Ideal Ciphers

Alexandru Cojocaru, University of Edinburgh
Minki Hhan, The University of Texas at Austin
Qipeng Liu, UC San Diego
Takashi Yamakawa, NTT Social Informatics Laboratories
Aaram Yun, Ewha Womans University
Abstract

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.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint.
Contact author(s)
a cojocaru @ ed ac uk
minki hhan @ austin utexas edu
qipengliu @ ucsd edu
takashi yamakawa @ ntt com
aaramyun @ ewha ac kr
History
2025-04-27: approved
2025-04-25: received
See all versions
Short URL
https://ia.cr/2025/738
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2025/738,
      author = {Alexandru Cojocaru and Minki Hhan and Qipeng Liu and Takashi Yamakawa and Aaram Yun},
      title = {Quantum Lifting for Invertible Permutations and Ideal Ciphers},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/738},
      year = {2025},
      url = {https://eprint.iacr.org/2025/738}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.