Construction of APN permutations via Walsh zero spaces

DOI10.1007/s12095-022-00580-9zbMath1505.94133arXiv2110.15582OpenAlexW3209060430WikidataQ114849123 ScholiaQ114849123MaRDI QIDQ2096658

Petr Lisoněk, Benjamin Chase

Publication date: 11 November 2022

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.15582

zbMATH Keywords

finite fieldcryptographyBoolean functionAPN functionWalsh zero

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Boolean functions (94D10)

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gold and Kasami-Welch functions, quadratic forms, and bent functions
• Codes, bent functions and permutations suitable for DES-like cryptosystems
• On CCZ-equivalence, extended-affine equivalence, and function twisting
• A further study of quadratic APN permutations in dimension nine
• Anomalies and vector space search: tools for S-box analysis
• Two Classes of Quadratic APN Binomials Inequivalent to Power Functions
• On known constructions of APN and AB functions and their relation to each other
• New Instances of Quadratic APN Functions
• Boolean Functions for Cryptography and Coding Theory
• Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
• Cryptography