On those multiplicative subgroups of F₂^n^ which are Sidon sets and/or sum-free sets
A Sidon \(S\) set in a group \((G,+)\) is a set with no points \(x,y,z,t\in S\), at least three of them pairwise dintinct, such that \(x+y = z+t\). The set \(S\) is sum-free if it does not contain a triple \(x,y,z\in S\) such that \(x+y = z\). The multiplicative subgroups of the linear space \(\mathbb{F}_2^n\), which is naturally identified with the field \(\mathbb{F}_{2^n}\), are considered in the current paper to give sufficient conditions for those subgroups to be either Sidon, sum-free or of both types. The proposed approach is of practical interest since it provides exponents of APN power functions which in turn may be suited for stream ciphers which are optimally robust against differential attacks. The authors give several lists of integers whose greatest common divisors (gcd) with the order of \(\mathbb{F}_2^n\) are the orders of multiplicative subgroups which are Sidon and sum-free sets. Also there are given some sufficient conditions in terms of gcd of polynomials for multiplicative subgroups which are also Sidon or sum-free sets. Some other conditions are stated in terms of the orders of the multiplicative groups. Certainly it is quite relevant the influence of the multiplicative structures fo finite fields in the additive properties. The paper includes ending tables for Sidon and sum-free multiplicative subgroups in finite fields quite complete for \(n\leq 15\). The paper is an illustrative piece of precise and useful calculations for counting problems in finite fields.
- A note on sumsets of subgroups in Z_p^*
- On subset sums of zero-sum free sets of abelian groups
- On multiplicative Sidon sets
- On sumsets in \(\mathbb{F}^n_2\)
- On strongly sum-free subsets of abelian groups
- Sidon sets and 2-caps in \(\mathbb{F}_3^n\)
- On sum sets of Sidon sets. II
- On sum-free subsets of the torus group
- Sum of elements in finite Sidon sets. II
- Structure and existence of sidon sets on compact groups
- Analysis of Euclidean algorithms for polynomials over finite fields
- Boolean functions for cryptography and coding theory
- Characterizations of the Differential Uniformity of Vectorial Functions by the Walsh Transform
- Sidon sets in groups and induced subgraphs of Cayley graphs
- Sum-free sets in abelian groups
- Sum-free sets in groups: a survey
- Vectorial Boolean functions for cryptography
- On the exponents of APN power functions and Sidon sets, sum-free sets, and Dickson polynomials
- On APN functions whose graphs are maximal Sidon sets
- On large Sidon sets
- Sidon sets, thin sets, and the nonlinearity of vectorial Boolean functions
- A new construction of locally-APN functions on \(\mathbb{F}_2^{2m}\) using spreads and Sidon sets
This page was built for publication: On those multiplicative subgroups of \({\mathbb F}_{2^n}^\ast\) which are Sidon sets and/or sum-free sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2114773)
