A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function
From MaRDI portal
(Redirected from Publication:669952)
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)
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
Cites work
- scientific article; zbMATH DE number 3887879 (Why is no real title available?)
- scientific article; zbMATH DE number 177030 (Why is no real title available?)
- scientific article; zbMATH DE number 1024005 (Why is no real title available?)
- scientific article; zbMATH DE number 2009966 (Why is no real title available?)
- scientific article; zbMATH DE number 1504540 (Why is no real title available?)
- scientific article; zbMATH DE number 4195884 (Why is no real title available?)
- A Framework for Chosen IV Statistical Analysis of Stream Ciphers
- Boolean function complexity. Advances and frontiers.
- Complexity measures and decision tree complexity: a survey.
- Construction of Boolean functions with excellent cryptographic criteria using bivariate polynomial representation
- How low can approximate degree and quantum query complexity be for total Boolean functions?
- Non-linear approximations in linear cryptanalysis
- On the power of Ambainis lower bounds
- Quantum Query Complexity of State Conversion
- Quantum algorithm to solve function inversion with time-space trade-off
- Quantum gates on hybrid qudits
- Quantum lower bounds by polynomials
- Quantum walk public-key cryptographic system
- SQUARE attack on block ciphers with low algebraic degree
- Strengths and Weaknesses of Quantum Computing
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
- Efficient quantum algorithm for the parity problem of a certain function
- SOFSEM 2005: Theory and Practice of Computer Science
- Parity decision tree in classical-quantum separations for certain classes of Boolean functions
- From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm
- A quantum algorithm to approximate the linear structures 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
- scientific article; zbMATH DE number 6297720 (Why is no real title available?)
- Quantum algorithms for learning the algebraic normal form of quadratic Boolean functions
- An exact quantum algorithm for testing 3-junta in Boolean functions with one uncomplemented product
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)
