Efficient quantum algorithms related to autocorrelation spectrum

DOI10.1007/978-3-030-35423-7_21zbMath1456.94048arXiv1808.04448OpenAlexW2979930500MaRDI QIDQ2179405

Sapv Tharrmashastha, Debajyoti Bera, Subhamoy Maitra

Publication date: 12 May 2020

Full work available at URL: https://arxiv.org/abs/1808.04448

zbMATH Keywords

Walsh spectrumquantum computingcryptologyBoolean functionautocorrelation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items

Following forrelation -- quantum algorithms in exploring Boolean functions' spectra, A quantum algorithm to estimate the Gowers \(U_2\) norm and linearity testing of Boolean functions, Quantum algorithms for learning Walsh spectra of multi-output Boolean functions, Quantum cryptographic property testing of multi-output Boolean functions

Cites Work

• Unnamed Item
• Unnamed Item
• Observing biases in the state: case studies with Trivium and Trivia-SC
• Grover meets Simon -- quantumly attacking the FX-construction
• An efficient quantum collision search algorithm and implications on symmetric cryptography
• Quantum algorithms on Walsh transform and Hamming distance for Boolean functions
• Applying Grover’s Algorithm to AES: Quantum Resource Estimates
• Breaking Symmetric Cryptosystems Using Quantum Period Finding
• Rapid solution of problems by quantum computation
• Construction of $n$ -Variable ( $n\equiv 2 \bmod 4$ ) Balanced Boolean Functions With Maximum Absolute Value in Autocorrelation Spectra $
• Higher Order Derivatives and Differential Cryptanalysis
• THE DEUTSCH–JOZSA ALGORITHM REVISITED IN THE DOMAIN OF CRYPTOGRAPHICALLY SIGNIFICANT BOOLEAN FUNCTIONS