On the two-sided permutation inversion problem

DOI10.62056/A0QJ89N4EMaRDI QIDQ7318579zbMATH OpenFDO

Authors Gorjan Alagic, Chen Bai, Alexander Poremba, Kaiyan Shi

Publication date 25 August 2026

Published in IACR Communications in Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/A0QJ89N4E

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
• Dense quantum coding and a lower bound for 1-way quantum automata
• How to record quantum queries, and applications to quantum indifferentiability
• scientific article; zbMATH DE number 3825698 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• Non-uniformity and quantum advice in the quantum random oracle model
• On lattices, learning with errors, random linear codes, and cryptography
• On the Power of Quantum Computation
• Post-quantum security of the Even-Mansour cipher
• Post-quantum security of the sponge construction
• Quantum lower bounds by quantum arguments
• Quantum random oracle model with auxiliary input
• Quantum security proofs using semi-classical oracles
• Quantum time/memory/data tradeoff attacks
• Strengths and Weaknesses of Quantum Computing
• Tight quantum time-space tradeoffs for function inversion

Cited in

(1)

• Quantum search with in-place queries

This page was built for publication: On the two-sided permutation inversion problem

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