arXiv · 1611.05564
A Note on Quantum-Secure PRPs
Abstract
We show how to construct pseudorandom permutations (PRPs) that remain secure even if the adversary can query the permutation, both in the forward and reverse directions, on a quantum superposition of inputs. Such quantum-secure PRPs have found numerous applications in cryptography and complexity theory. Our construction combines a quantum-secure pseudorandom function together with constructions of classical format preserving encryption. By combining known results, we show how to construct quantum-secure PRP in this model whose security relies only on the existence of one-way functions.
Explore related subjects
Keep this discovery
Mark Zhandry. 2016-11-17. A Note on Quantum-Secure PRPs. https://doi.org/10.22331/q-2025-04-08-1696
Cite the original work for its findings. Save a collection to share your selection of sources.