Quantum algorithm to solve function inversion with time-space trade-off
From MaRDI portal
Recommendations
- Efficient quantum algorithm for the parity problem of a certain function
- On quantum algorithm for exptime problem
- scientific article; zbMATH DE number 7759460
- Rigorous Time/Space Trade-offs for Inverting Functions
- Quantum algorithms
- scientific article; zbMATH DE number 1839431
- Quantum Algorithms
- Efficient Construction of Functional Representations for Quantum Algorithms
- Quantum algorithms revisited
Cites work
- scientific article; zbMATH DE number 1406124 (Why is no real title available?)
- Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
- On the Power of Quantum Computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Polynomial-time quantum algorithms for finding the linear structures of Boolean function
- Quantum Complexity Theory
- Quantum algorithm to find invariant linear structure of MD hash functions
- Rapid solution of problems by quantum computation
- The Hidden Subgroup Problem and Quantum Computation Using Group Representations
Cited in
(6)- Two-party quantum private comparison protocol with maximally entangled seven-qubit state
- Rigorous Time/Space Trade-offs for Inverting Functions
- Entanglement swapping for Bell states and Greenberger-Horne-Zeilinger states in qubit systems
- Practical quantum private query based on Bell state
- Quantum protocols for secure multi-party summation
- A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function
This page was built for publication: Quantum algorithm to solve function inversion with time-space trade-off
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1674561)
