Back to Search
Start Over
Introducing nega-Forrelation: quantum algorithms in analyzing nega-Hadamard and nega-crosscorrelation spectra.
- Source :
- Designs, Codes & Cryptography; Mar2024, Vol. 92 Issue 3, p863-883, 21p
- Publication Year :
- 2024
-
Abstract
- Aaronson defined Forrelation (2010) as a measure of correlation between a Boolean function f and the Walsh–Hadamard transform of another function g . In a recent work, we have studied different cryptographically important spectra of Boolean functions through the lens of Forrelation. In this paper, we explore a similar kind of correlation in terms of nega-Hadamard transform. We call it nega-Forrelation and obtain a more efficient sampling strategy for nega-Hadamard transform compared to the existing results. Moreover, we present an efficient sampling strategy for nega-crosscorrelation (and consequently nega-autocorrelation) spectra too, by tweaking the nega-Forrelation technique. Finally, we connect the hidden shift finding algorithm for bent functions (Rötteler, 2010) with the Forrelation algorithm and extend it for the negabent functions. [ABSTRACT FROM AUTHOR]
- Subjects :
- BENT functions
BOOLEAN functions
ALGORITHMS
CRYPTOGRAPHY
Subjects
Details
- Language :
- English
- ISSN :
- 09251022
- Volume :
- 92
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- Designs, Codes & Cryptography
- Publication Type :
- Academic Journal
- Accession number :
- 176339424
- Full Text :
- https://doi.org/10.1007/s10623-023-01346-x