A Note on APN Permutations and Their Derivatives

Prior to the discovery of an APN permutation in six dimension it was conjectured that such functions do not exist in even dimension, as none had been found at that time. However, finding APN permutations in even dimension <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML&...

Full description

Saved in:
Bibliographic Details
Main Author: Augustine Musukwa
Format: Article
Language:English
Published: MDPI AG 2024-11-01
Series:Mathematics
Subjects:
Online Access:https://www.mdpi.com/2227-7390/12/22/3477
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Prior to the discovery of an APN permutation in six dimension it was conjectured that such functions do not exist in even dimension, as none had been found at that time. However, finding APN permutations in even dimension <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>≥</mo><mn>8</mn></mrow></semantics></math></inline-formula> remains a significant challenge. Understanding and determining more properties of these functions is a crucial approach to discovering them. In this note, we study the properties of vectorial Boolean functions based on the weights of the first-order and second-order derivatives of their components. We show that a function is an APN permutation if and only if the sum of the squares of the weights of the first-order derivatives of its components is exactly <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msup><mn>2</mn><mrow><mn>2</mn><mi>n</mi><mo>−</mo><mn>1</mn></mrow></msup><mrow><mo>(</mo><msup><mn>2</mn><mrow><mi>n</mi><mo>−</mo><mn>1</mn></mrow></msup><mo>+</mo><mn>1</mn><mo>)</mo></mrow><mrow><mo>(</mo><msup><mn>2</mn><mi>n</mi></msup><mo>−</mo><mn>1</mn><mo>)</mo></mrow></mrow></semantics></math></inline-formula>. Additionally, we determined that the sum of the weights of the second-order derivatives of the components of any vectorial Boolean function is at most <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msup><mn>2</mn><mrow><mn>2</mn><mi>n</mi><mo>−</mo><mn>1</mn></mrow></msup><mrow><mo>(</mo><msup><mn>2</mn><mi>n</mi></msup><mo>−</mo><mn>1</mn><mo>)</mo></mrow><mrow><mo>(</mo><msup><mn>2</mn><mi>n</mi></msup><mo>−</mo><mn>2</mn><mo>)</mo></mrow></mrow></semantics></math></inline-formula>. This bound is achieved if and only if a function is APN.
ISSN:2227-7390