A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function
From MaRDI portal
Publication:669952
DOI10.1007/s11128-019-2175-zzbMath1417.81104OpenAlexW2910802016WikidataQ128583795 ScholiaQ128583795MaRDI QIDQ669952
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Quantum private comparison of size using \(d\)-level Bell states with a semi-honest third party ⋮ Multi-party quantum summation without a third party based on \(d\)-dimensional Bell states
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How low can approximate degree and quantum query complexity be for total Boolean functions?
- On the power of Ambainis lower bounds
- Boolean function complexity. Advances and frontiers.
- Quantum algorithm to solve function inversion with time-space trade-off
- Complexity measures and decision tree complexity: a survey.
- Quantum walk public-key cryptographic system
- Construction of Boolean functions with excellent cryptographic criteria using bivariate polynomial representation
- Non-Linear Approximations in Linear Cryptanalysis
- Strengths and Weaknesses of Quantum Computing
- Separations in Query Complexity Based on Pointer Functions
- Quantum gates on hybrid qudits
- SQUARE attack on block ciphers with low algebraic degree
- Quantum lower bounds by polynomials
- A Framework for Chosen IV Statistical Analysis of Stream Ciphers
- Quantum Query Complexity of State Conversion
This page was built for publication: A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function
