A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function
DOI10.1007/S11128-019-2175-ZzbMATH Open1417.81104OpenAlexW2910802016WikidataQ128583795 ScholiaQ128583795MaRDI QIDQ669952FDOQ669952
Authors: Wanqing Wu, Huanguo Zhang 
Publication date: 15 March 2019
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-019-2175-z
Recommendations
- SOFSEM 2005: Theory and Practice of Computer Science
- Polynomial-time quantum algorithms for finding the linear structures of Boolean function
- Application of Grover's algorithm to check non-resiliency of a Boolean function
- Boolean functions identification via quantum computing methods
- Quantum algorithms for learning the algebraic normal form of quadratic Boolean functions
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94) Topological lattices (06B30)
Cites Work
- Strengths and Weaknesses of Quantum Computing
- Non-linear approximations in linear cryptanalysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Framework for Chosen IV Statistical Analysis of Stream Ciphers
- Boolean function complexity. Advances and frontiers.
- Complexity measures and decision tree complexity: a survey.
- Quantum lower bounds by polynomials
- Quantum Query Complexity of State Conversion
- Quantum gates on hybrid qudits
- How low can approximate degree and quantum query complexity be for total Boolean functions?
- On the power of Ambainis lower bounds
- Quantum algorithm to solve function inversion with time-space trade-off
- Quantum walk public-key cryptographic system
- Construction of Boolean functions with excellent cryptographic criteria using bivariate polynomial representation
- Title not available (Why is that?)
- SQUARE attack on block ciphers with low algebraic degree
Cited In (12)
- Application of Grover's algorithm to check non-resiliency of a Boolean function
- Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems
- Parity decision tree in classical-quantum separations for certain classes of Boolean functions
- Multi-party quantum summation without a third party based on \(d\)-dimensional Bell states
- Quantum private comparison of size using \(d\)-level Bell states with a semi-honest third party
- An exact quantum algorithm for testing 3-junta in Boolean functions with one uncomplemented product
- Efficient quantum algorithm for the parity problem of a certain function
- Quantum algorithms for learning the algebraic normal form of quadratic Boolean functions
- From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm
- Title not available (Why is that?)
- SOFSEM 2005: Theory and Practice of Computer Science
- A quantum algorithm to approximate the linear structures of Boolean functions
This page was built for publication: A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q669952)
