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

DOI10.1007/s10623-023-01346-xOpenAlexW4390262957MaRDI QIDQ6130621

Subhamoy Maitra, Suman Dutta

Publication date: 3 April 2024

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-023-01346-x

zbMATH Keywords

quantum algorithmsBoolean functionscryptologyWalsh-Hadamard transformnega-Hadamard transformforrelationhidden-shift problemnega-forrelation

Mathematics Subject Classification ID

Boolean functions (94D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cross-correlation analysis of cryptographically useful boolean functions and s-boxes
• BQP and the polynomial hierarchy
• Forrelation
• Generalized Bent Criteria for Boolean Functions (I)
• Nega–Hadamard Transform, Bent and Negabent Functions
• Rapid solution of problems by quantum computation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Power of Quantum Computation
• Investigations on Bent and Negabent Functions via the Nega-Hadamard Transform
• Quantum Algorithms Related to $$\textit{HN}$$ -Transforms of Boolean Functions

This page was built for publication: Introducing nega-forrelation: quantum algorithms in analyzing nega-Hadamard and nega-crosscorrelation spectra