Modifications of bijective S-boxes with linear structures

DOI10.1007/S12095-023-00631-9zbMath1529.94032WikidataQ123367484 ScholiaQ123367484MaRDI QIDQ6107457

Kaisa Nyberg

Publication date: 3 July 2023

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

zbMATH Keywords

Boolean functionsAPN functionslinear structuresbijective S-boxesmodification of bijective S-boxes

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (94D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• When does \(G(x)+\gamma \, \text{Tr}(H(x))\) permute \(\mathbb F_{p^n}\)?
• 4-uniform permutations with null nonlinearity
• On a Class of Permutation Polynomials over $\mathbb{F}_{2^n}$
• Boolean Functions for Cryptography and Coding Theory
• Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)

This page was built for publication: Modifications of bijective S-boxes with linear structures