Application of Grover's algorithm to check non-resiliency of a Boolean function

DOI10.1007/S12095-015-0156-3zbMATH Open1338.81131OpenAlexW1412075677MaRDI QIDQ276563FDOQ276563

Authors: Kaushik Chakraborty, Subhamoy Maitra 

Publication date: 4 May 2016

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-015-0156-3

Recommendations

• A quantum algorithm for testing and learning resiliency of a Boolean function
• Quantum algorithms for the resiliency of vectorial Boolean functions
• Boolean functions identification via quantum computing methods
• A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function
• Quantum algorithms for testing and learning Boolean functions

zbMATH Keywords

measurementquantum algorithmsBoolean functionsDeutsch-Jozsa algorithmGrover's algorithmresiliency

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

• Title not available (Why is that?)
• Quantum computation and quantum information. 10th anniversary edition
• New upper bounds on the Boolean circuit complexity of symmetric functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Linearity testing in characteristic two
• Quantum Property Testing
• Exact quantum algorithm to distinguish Boolean functions of different weights
• A spectral characterization of correlation-immune combining functions
• Rapid solution of problems by quantum computation
• Title not available (Why is that?)
• THE DEUTSCH–JOZSA ALGORITHM REVISITED IN THE DOMAIN OF CRYPTOGRAPHICALLY SIGNIFICANT BOOLEAN FUNCTIONS

Cited In (8)

• Quantum cryptographic property testing of multi-output Boolean functions
• Quantum algorithms on Walsh transform and Hamming distance for Boolean functions
• Quantum algorithms for the resiliency of vectorial Boolean functions
• Quantum mechanical \(m\)-resiliency checking of a Boolean function: invasion of the complexity from computation to measurement
• Following forrelation -- quantum algorithms in exploring Boolean functions' spectra
• Conservation laws in quantum database search
• A quantum algorithm for testing and learning resiliency of a Boolean function
• A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function

This page was built for publication: Application of Grover's algorithm to check non-resiliency of a Boolean function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q276563)