Paper 2024/1140
Permutation Superposition Oracles for Quantum Query Lower Bounds
Abstract
We propose a generalization of Zhandry’s compressed oracle method to random permutations, where an algorithm can query both the permutation and its inverse. We show how to use the resulting oracle simulation to bound the success probability of an algorithm for any predicate on input-output pairs, a key feature of Zhandry’s technique that had hitherto resisted attempts at generalization to random permutations. One key technical ingredient is to use strictly monotone factorizations to represent the permutation in the oracle’s database. As an application of our framework, we show that the one-round sponge construction is unconditionally preimage resistant in the random permutation model. This proves a conjecture by Unruh.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- Quantum CryptographyQuantum Random Oracle
- Contact author(s)
-
chmaj @ dtu dk
giulio malavolta @ hotmail it
michael walter @ rub de - History
- 2024-07-15: approved
- 2024-07-13: received
- See all versions
- Short URL
- https://ia.cr/2024/1140
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1140,
author = {Christian Majenz and Giulio Malavolta and Michael Walter},
title = {Permutation Superposition Oracles for Quantum Query Lower Bounds},
howpublished = {Cryptology ePrint Archive, Paper 2024/1140},
year = {2024},
note = {\url{https://eprint.iacr.org/2024/1140}},
url = {https://eprint.iacr.org/2024/1140}
}
