Tight quantum time-space tradeoffs for permutation inversion

DOI10.1007/978-3-032-25291-3_15MaRDI QIDQ7299732zbMATH OpenFDO

Authors Akshima, Tyler Besselman, Kai-Min Chung, Siyao Guo, Tzu-Yi Yang

Publication date 20 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-25291-3_15

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A cryptanalytic time-memory trade-off
• Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
• How to record quantum queries, and applications to quantum indifferentiability
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• Inverting a permutation is as hard as unordered search
• Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
• Non-uniformity and quantum advice in the quantum random oracle model
• On obfuscating point functions
• Quantum lower bounds by quantum arguments
• Quantum random oracle model with auxiliary input
• Strengths and Weaknesses of Quantum Computing
• The function-inversion problem: barriers and opportunities
• Tight quantum time-space tradeoffs for function inversion
• Time space tradeoffs for attacks against one-way functions and PRGs
• Unifying presampling via concentration bounds

This page was built for publication: Tight quantum time-space tradeoffs for permutation inversion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299732)