On weakly APN functions and 4-bit S-Boxes

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.

• Publication year

  2011

• Venue

  Finite Fields Their Appl.

• Publication date

  2011-02-17

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.ffa.2011.11.003arXiv 1102.3882
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Cryptographic Analysis of All 4 x 4 - Bit S-Boxes

  2011cited by this paper
• Advanced Encryption Standard

  2011influential reference
• A few more functions that are not APN infinitely often

  2009cited by this paper
• On some block ciphers and imprimitive groups

  2008influential reference
• Fourier Spectra of Binomial APN Functions

  2008cited by this paper
• On the Classification of 4 Bit S-Boxes

  2007cited by this paper
• PRESENT: An Ultra-Lightweight Block Cipher

  2007influential reference
• A new class of monomial bent functions

  2006cited by this paper
• Propagation Characteristics of Boolean Functions

  2005cited by this paper
• Construction of Cryptographically Important Boolean Permutations

  2004cited by this paper
• National Institute of Standards and Technologyにおける超伝導研究及び生活

  2001cited by this paper
• Imprimitive Permutation Groups and Trapdoors in Iterated Block Ciphers

  1999cited by this paper
• Serpent: A New Block Cipher Proposal

  1998cited by this paper
• The structured design of cryptographically good s-boxes

  1990cited by this paper

• Cryptographic properties of small bijective S-boxes with respect to modular addition

  2020cites this paper
• On Second-Order Derivatives of Boolean Functions and Cubic APN Permutations in Even Dimension

  2019cites this paper
• On Boolean functions, symmetric cryptography and algebraic coding theory

  2015cites this paper
• A note on APN permutations in even dimension

  2015cites this paper
• The role of Boolean functions in hiding sums as trapdoors for some block ciphers

  2014cites this paper
• On weak differential uniformity of vectorial Boolean functions as a cryptographic criterion

  2014influential citation
• On the group generated by the round functions of translation based ciphers over arbitrary finite fields

  2013cites this paper