Vectorial functions and covering sequences
The design of large classes of highly resilient vectorial functions (mappings from \(\mathbb F_2^n\) into \(\mathbb F_2^m\), also called \(S\)-boxes or \((n,m)\)-functions) is needed for iterated block ciphers and for pseudo-random generators with multiple output. To protect the cryptosystems from attacks, these \((n,m)\)-functions must have a high algebraic degree and a high nonlinearity. In this paper, the authors recall the diverse known constructions of such \(S\)-boxes, and they show that those which provide good candidate functions are, in fact, all in the same class. This class corresponds to a generalization of a well known construction due to Maiorana and Mac-Farland. In a second part, the authors generalize to S-boxes the notion of covering sequence. The authors show that this generalization has the same properties as for Boolean functions, and that it has nice additional properties of stability. For the entire collection see [Zbl 1048.11003].
- Vector-covering systems of arithmetic sequences
- On sequence space representation and extension of vector-valued functions
- Recurring sequences over vector spaces
- scientific article; zbMATH DE number 5974986
- Functional covering numbers
- On vector polynomial sequences
- scientific article; zbMATH DE number 845762
- scientific article; zbMATH DE number 1076933
- scientific article; zbMATH DE number 38124
- A class of spaces of vector sequences
- Covering sequences of Boolean functions and their cryptographic significance
- Enumerating functions for nonnegative integer coordinates of \(L\)-dimensional vectors
- A new criterion for avoiding the propagation of linear relations through an sbox
- On the diffusion property of iterated functions
- Vector-covering systems of arithmetic sequences
This page was built for publication: Vectorial functions and covering sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4832291)