On APN functions whose graphs are maximal Sidon sets

DOI10.1007/978-3-031-20624-5_15OpenAlexW4313166192MaRDI QIDQ6109009

Claude Carlet

Publication date: 26 July 2023

Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-20624-5_15

zbMATH Keywords

almost perfect nonlinear functionsymmetric cryptographySidon set in an abelian group

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications of graph theory to circuits and networks (94C15) Abelian groups (20Kxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructing new APN functions from known ones
• Sidon sets in groups and induced subgraphs of Cayley graphs
• Codes, bent functions and permutations suitable for DES-like cryptosystems
• Codes, graphs, and schemes from nonlinear functions
• On those multiplicative subgroups of \({\mathbb F}_{2^n}^\ast\) which are Sidon sets and/or sum-free sets
• A new almost perfect nonlinear function which is not quadratic
• Plateaudness of Kasami APN functions
• Boolean and Vectorial Plateaued Functions and APN Functions
• New classes of almost bent and almost perfect nonlinear polynomials
• On Almost Perfect Nonlinear Permutations
• Bounds on the Nonlinearity of Differentially Uniform Functions by Means of Their Image Set Size, and on Their Distance to Affine Functions
• On the Distance Between APN Functions
• Boolean Functions for Cryptography and Coding Theory
• On Upper Bounds for Algebraic Degrees of APN Functions
• Trade-Offs for S-Boxes: Cryptographic Properties and Side-Channel Resilience

This page was built for publication: On APN functions whose graphs are maximal Sidon sets