On those multiplicative subgroups of F₂^n^ which are Sidon sets and/or sum-free sets

DOI10.1007/S10801-020-00988-7MaRDI QIDQ2114773zbMATH OpenOpenAlexFDO

Authors Claude Carlet, Sihem Mesnager

Publication date 15 March 2022

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10801-020-00988-7

zbMATH Keywords

APN functionsSidon setssymmetric cryptographysum-free setsAPN exponents

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Other combinatorial number theory (11B75) Arithmetic combinatorics; higher degree uniformity (11B30) Boolean functions (94D10)

Recommendations

• A note on sumsets of subgroups in \(\mathbb 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

Cites work

• 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

Cited in

(2)

• 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

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)