2025/07/09 by Suman Dutta, Subhamoy Maitra, Dutta, Suman +3
Computer Science · #Coding theory and cryptography #FOS: Physical sciences #Polynomial and algebraic computation #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.2507.07231
openalex publication_date 2025/07/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we study different cryptographically significant spectra of Boolean functions, including the Walsh-Hadamard, cross-correlation, and autocorrelation. The 2k-variation by Stanica [IEEE-IT 2016] is considered here with the formulation for any m ∈ ℕ. Given this, we present the most generalized version of the Deutsch-Jozsa algorithm, which extends the standard and previously extended versions, thereby encompassing them as special cases. Additionally, we generalize the Forrelation formulation by introducing the m-Forrelation and propose various quantum algorithms towards its estimation. In this regard, we explore different strategies in sampling these newly defined spectra using the proposed m-Forrelation algorithms and present a comparison of their corresponding success probabilities. Finally, we address the problem related to affine transformations of generalized bent functions and discuss quantum algorithms in identifying the shifts between two bent (or negabent) functions with certain modifications, and compare these with existing results.