Characterization of linear structures
From MaRDI portal
Recommendations
Cited in
(18)- A quantum related-key attack based on the Bernstein-Vazirani algorithm
- On the conjecture about the linear structures of rotation symmetric Boolean functions
- The linear structures and fast points of rotation symmetric Boolean functions
- Using Bernstein-Vazirani algorithm to attack block ciphers
- On a Class of Permutation Polynomials over $\mathbb{F}_{2^n}$
- Zero-correlation linear analysis for block ciphers based on the Bernstein-Vazirani and Grover algorithms
- The \textit{crooked} property
- Improved BV-based quantum attack on block ciphers
- Some remarks on the TKIP key mixing function of IEEE 802.11i
- When does \(G(x)+\gamma \, \text{Tr}(H(x))\) permute \(\mathbb F_{p^n}\)?
- scientific article; zbMATH DE number 3851283 (Why is no real title available?)
- Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet Grover algorithm
- scientific article; zbMATH DE number 40988 (Why is no real title available?)
- Polynomial-time quantum algorithms for finding the linear structures of Boolean function
- Maximal complete permutations over \(\mathbb{F}_2^n \)
- Quantum algorithm for finding impossible differentials and zero-correlation linear hulls of symmetric ciphers
- On derivatives of polynomials over finite fields through integration
- A quantum algorithm to approximate the linear structures of Boolean functions
This page was built for publication: Characterization of linear structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1841525)