A quantum algorithm for testing and learning resiliency of a Boolean function
From MaRDI portal
Publication:669925
DOI10.1007/s11128-018-2162-9zbMath1409.81030OpenAlexW2907280983MaRDI QIDQ669925
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-018-2162-9
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Quantum algorithms for learning the algebraic normal form of quadratic Boolean functions ⋮ Quantum algorithms for the resiliency of vectorial Boolean functions ⋮ Quantum cryptographic property testing of multi-output Boolean functions
Cites Work
- Unnamed Item
- Unnamed Item
- Application of Grover's algorithm to check non-resiliency of a Boolean function
- Correlation-immune and resilient functions over a finite alphabet and their applications in cryptography
- Three characterizations of non-binary correlation-immune and resilient functions
- A quantum algorithm for approximating the influences of Boolean functions and its applications
- Generalized Maiorana–McFarland Construction of Resilient Boolean Functions With High Nonlinearity and Good Algebraic Properties
- Almost Security of Cryptographic Boolean Functions
- Privacy Amplification by Public Discussion
- A spectral characterization of correlation-immune combining functions
- Rapid solution of problems by quantum computation
- Cryptographically resilient functions
- On cryptographic properties of the cosets of R(1, m)
- Constructions of Almost Optimal Resilient Boolean Functions on Large Even Number of Variables
- Probability Inequalities for Sums of Bounded Random Variables
- Applied Cryptography and Network Security
- Almost \(k\)-wise independent sample spaces and their cryptologic applications
This page was built for publication: A quantum algorithm for testing and learning resiliency of a Boolean function
