Quantum algorithms for learning the algebraic normal form of quadratic Boolean functions

DOI10.1007/s11128-020-02778-3OpenAlexW3045896525WikidataQ115145909 ScholiaQ115145909MaRDI QIDQ2681633

Xuexuan Hao, Yong Zhou, Fengrong Zhang, Shixiong Xia

Publication date: 3 February 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-020-02778-3

zbMATH Keywords

quantum computationBoolean functionBernstein-Vazirani algorithmquantum cryptanalysis

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the second-order nonlinearity of the hidden weighted bit function
• A quantum algorithm for testing and learning resiliency of a Boolean function
• Correlation of quadratic Boolean functions: cryptanalysis of all versions of full MORUS
• A quantum algorithm for approximating the influences of Boolean functions and its applications
• Using Bernstein-Vazirani algorithm to attack block ciphers
• A family of difference sets in non-cyclic groups
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Power of Quantum Computation
• Quantum Complexity Theory
• A quantum algorithm to approximate the linear structures of Boolean functions
• Quantum algorithms for testing and learning Boolean functions
• Low order approximation of cipher functions

This page was built for publication: Quantum algorithms for learning the algebraic normal form of quadratic Boolean functions