On weakly APN functions and 4-bit S-boxes
From MaRDI portal
Publication:413552
DOI10.1016/J.FFA.2011.11.003zbMATH Open1271.94019arXiv1102.3882OpenAlexW2963332150MaRDI QIDQ413552FDOQ413552
Massimiliano Sala, Claudio Fontanari, Anna Rimoldi, Valentina Pulice
Publication date: 7 May 2012
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Abstract: S-Boxes are important security components of block ciphers. We provide theoretical results on necessary or sufficient criteria for an (invertible) 4-bit S-Box to be weakly APN. Thanks to a classification of 4-bit invertible S-Boxes achieved independently by De Canni'ere and Leander-Poschmann, we can strengthen our results with a computer-aided proof.
Full work available at URL: https://arxiv.org/abs/1102.3882
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A few more functions that are not APN infinitely often
- A new class of monomial bent functions
- Cryptographic Analysis of All 4 × 4-Bit S-Boxes
- PRESENT: An Ultra-Lightweight Block Cipher
- On the Classification of 4 Bit S-Boxes
- Serpent: A New Block Cipher Proposal
- The structured design of cryptographically good s-boxes
- Fourier Spectra of Binomial APN Functions
- Construction of cryptographically important Boolean permutations
- On some block ciphers and imprimitive groups
Cited In (5)
- On second-order derivatives of Boolean functions and cubic APN permutations in even dimension
- A note on APN permutations in even dimension
- On the group generated by the round functions of translation based ciphers over arbitrary finite fields
- Cryptographic properties of small bijective S-boxes with respect to modular addition
- On weak differential uniformity of vectorial Boolean functions as a cryptographic criterion
Uses Software
This page was built for publication: On weakly APN functions and 4-bit S-boxes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413552)
