Doubly perfect nonlinear Boolean permutations

DOI10.1080/09720529.2010.10698315zbMATH Open1217.94103arXiv1003.4919OpenAlexW2963585336MaRDI QIDQ3008564FDOQ3008564

Laurent Poinsot

Publication date: 22 June 2011

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Abstract: Due to implementation constraints the XOR operation is widely used in order to combine plaintext and key bit-strings in secret-key block ciphers. This choice directly induces the classical version of the differential attack by the use of XOR-kind differences. While very natural, there are many alternatives to the XOR. Each of them inducing a new form for its corresponding differential attack (using the appropriate notion of difference) and therefore block-ciphers need to use S-boxes that are resistant against these nonstandard differential cryptanalysis. In this contribution we study the functions that offer the best resistance against a differential attack based on a finite field multiplication. We also show that in some particular cases, there are robust permutations which offers the best resistant against both multiplication and exponentiation base differential attacks. We call them doubly perfect nonlinear permutations.

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

Recommendations

• On Almost Perfect Nonlinear Permutations
• New differentially 4-uniform permutations from modifications of the inverse function
• Perfect nonlinear S-boxes
• More constructions of differentially 4-uniform permutations on \(\mathbb {F}_{2^{2k}}\)
• G-perfect nonlinear functions

zbMATH Keywords

group actionfinite fieldperfect nonlinear function

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Highly nonlinear mappings
• Perfect nonlinear S-boxes
• Communication Theory of Secrecy Systems*
• Differential cryptanalysis of DES-like cryptosystems

Cited In (3)

• Almost perfect nonlinear families which are not equivalent to permutations
• Highly nonlinear (vectorial) Boolean functions that are symmetric under some permutations
• Permutation and phase independent Boolean comparison

This page was built for publication: Doubly perfect nonlinear Boolean permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3008564)