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

DOI10.1007/s12095-015-0156-3zbMath1338.81131OpenAlexW1412075677MaRDI QIDQ276563

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

zbMATH Keywords

quantum algorithmsBoolean functionsmeasurementDeutsch-Jozsa algorithmGrover's algorithmresiliency

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (4)

Following forrelation -- quantum algorithms in exploring Boolean functions' spectra ⋮ A quantum algorithm for testing and learning resiliency of a Boolean function ⋮ Quantum algorithms on Walsh transform and Hamming distance for Boolean functions ⋮ Quantum cryptographic property testing of multi-output Boolean functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New upper bounds on the Boolean circuit complexity of symmetric functions
• Quantum Computation and Quantum Information
• 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
• THE DEUTSCH–JOZSA ALGORITHM REVISITED IN THE DOMAIN OF CRYPTOGRAPHICALLY SIGNIFICANT BOOLEAN FUNCTIONS

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