On those multiplicative subgroups of \({\mathbb F}_{2^n}^\ast\) which are Sidon sets and/or sum-free sets

DOI10.1007/s10801-020-00988-7zbMath1492.11061OpenAlexW3105338588MaRDI QIDQ2114773

Sihem Mesnager, Claude Carlet

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

sum-free setsSidon setsAPN functionssymmetric cryptographyAPN 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)

Related Items

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

Cites Work

• Unnamed Item
• Analysis of Euclidean algorithms for polynomials over finite fields
• Sidon sets in groups and induced subgraphs of Cayley graphs
• Sum-free sets in abelian groups
• Sum-free sets in groups: a survey
• Characterizations of the Differential Uniformity of Vectorial Functions by the Walsh Transform
• Boolean Functions for Cryptography and Coding Theory