Characterization of linear structures

DOI10.1023/A:1008399109102zbMath0963.94021OpenAlexW1605416950MaRDI QIDQ1841525

Sylvie Dubuc

Publication date: 18 February 2001

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008399109102

zbMATH Keywords

Fourier transformBoolean functionlinear structurevectorial function

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (13)

The \textit{crooked} property ⋮ Using Bernstein-Vazirani algorithm to attack block ciphers ⋮ Some remarks on the TKIP key mixing function of IEEE 802.11i ⋮ A quantum related-key attack based on the Bernstein-Vazirani algorithm ⋮ When does \(G(x)+\gamma \, \text{Tr}(H(x))\) permute \(\mathbb F_{p^n}\)? ⋮ Maximal complete permutations over \(\mathbb{F}_2^n \) ⋮ Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet Grover algorithm ⋮ A quantum algorithm to approximate the linear structures of Boolean functions ⋮ On the Conjecture About the Linear Structures of Rotation Symmetric Boolean Functions ⋮ On derivatives of polynomials over finite fields through integration ⋮ On a Class of Permutation Polynomials over $\mathbb{F}_{2^n}$ ⋮ Polynomial-time quantum algorithms for finding the linear structures of Boolean function ⋮ Improved BV-based quantum attack on block ciphers

This page was built for publication: Characterization of linear structures