A quantum algorithm to approximate the linear structures of Boolean functions

DOI10.1017/S0960129516000013zbMath1382.68082arXiv1404.0611OpenAlexW2606893413MaRDI QIDQ4599610

Li Yang, Hong-Wei Li

Publication date: 4 January 2018

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Boolean functions (06E30) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (6)

Quantum differential and linear cryptanalysis ⋮ Using Bernstein-Vazirani algorithm to attack block ciphers ⋮ A quantum related-key attack based on the Bernstein-Vazirani algorithm ⋮ Quantum algorithms for learning the algebraic normal form of quadratic Boolean functions ⋮ Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet Grover algorithm ⋮ Improved BV-based quantum attack on block ciphers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic nonlinearity and its applications to cryptography
• Characterization of linear structures
• Quantum Computation and Quantum Information
• Rapid solution of problems by quantum computation
• Quantum algorithms revisited
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Power of Quantum Computation
• Quantum algorithms for testing and learning Boolean functions
• Quantum complexity theory
• Probability Inequalities for Sums of Bounded Random Variables
• Quantum lower bounds by polynomials
• A polynomial quantum algorithm for approximating the Jones polynomial

This page was built for publication: A quantum algorithm to approximate the linear structures of Boolean functions