Quantum Algorithms Related to $$\textit{HN}$$ -Transforms of Boolean Functions

DOI10.1007/978-3-319-55589-8_21zbMath1420.94123OpenAlexW2594892253MaRDI QIDQ5739043

Nishant Sinha, Pantelimon Stănică, Sugata Gangopadhyay, Subhamoy Maitra

Publication date: 1 June 2017

Published in: Codes, Cryptology and Information Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-55589-8_21

zbMATH Keywords

Boolean function\(HN\)-transform, Deutsch-Jozsa algorithm

Mathematics Subject Classification ID

Fuzzy sets and logic (in connection with information, communication, or circuits theory) (94D05)

Related Items

Introducing nega-forrelation: quantum algorithms in analyzing nega-Hadamard and nega-crosscorrelation spectra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cryptographic Boolean functions with biased inputs
• Rotation symmetric Boolean functions-count and cryptographic properties
• A Note on Generalized Bent Criteria for Boolean Functions
• Cube Testers and Key Recovery Attacks on Reduced-Round MD6 and Trivium
• Generalized Bent Criteria for Boolean Functions (I)
• Negabent Functions in the Maiorana–McFarland Class
• Cube Attacks on Tweakable Black Box Polynomials
• Rapid solution of problems by quantum computation
• On the covering radius of binary codes (Corresp.)
• The covering radius of the<tex>(2^{15}, 16)</tex>Reed-Muller code is at least 16276
• On the Distribution of Boolean Function Nonlinearity
• Investigations on Bent and Negabent Functions via the Nega-Hadamard Transform
• On Boolean Functions Which Are Bent and Negabent
• Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I,H,N} n Transform
• THE DEUTSCH–JOZSA ALGORITHM REVISITED IN THE DOMAIN OF CRYPTOGRAPHICALLY SIGNIFICANT BOOLEAN FUNCTIONS