On quantum one-way permutations

MaRDI QIDQ3522390zbMATH OpenFDO

Authors

Publication date 3 September 2008

Full work available at URL https://arxiv.org/abs/quant-ph/0109157

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Quantum computation (81P68)

Recommendations

• Quantum one-way permutation over the finite field of two elements
• Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
• Inverting a permutation is as hard as unordered search
• Quantum lower bounds by quantum arguments
• Quantum complexity of permutations

Cited in

(7)

• Quantum one-way permutation over the finite field of two elements
• Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
• Universal test for quantum one-way permutations
• Quantum complexity of permutations
• Quantum Circuits for the Unitary Permutation Problem
• Mathematical Foundations of Computer Science 2004
• Statistical zero knowledge and quantum one-way functions

This page was built for publication: On quantum one-way permutations

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