# Anomalies and Vector Space Search: Tools for S-Box Analysis

Abstract : S-boxes are functions with an input so small that the simplest way to specify them is their lookup table (LUT). How can we quantify the distance between the behavior of a given S-box and that of an S-box picked uniformly at random? To answer this question, we introduce various "anomalies". These real numbers are such that a property with an anomaly equal to should be found roughly once in a set of $2^a$ random S-boxes. First, we present statistical anomalies based on the distribution of the coefficients in the difference distribution table, linear approximation table, and for the first time, the boomerang connectivity table. We then count the number of S-boxes that have block-cipher like structures to estimate the anomaly associated to those. In order to recover these structures, we show that the most general tool for decomposing S-boxes is an algorithm efficiently listing all the vector spaces of a given dimension contained in a given set, and we present such an algorithm. Combining these approaches, we conclude that all permutations that are actually picked uniformly at random always have essentially the same cryptographic properties and the same lack of structure.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [42 references]

https://hal.inria.fr/hal-02396738
Contributor : Léo Perrin Connect in order to contact the contributor
Submitted on : Friday, December 6, 2019 - 10:53:28 AM
Last modification on : Thursday, January 7, 2021 - 3:38:03 PM
Long-term archiving on: : Saturday, March 7, 2020 - 2:17:35 PM

### File

paper.pdf
Files produced by the author(s)

### Citation

Xavier Bonnetain, Léo Perrin, Shizhu Tian. Anomalies and Vector Space Search: Tools for S-Box Analysis. ASIACRYPT 2019 - 25th International Conference on the Theory and Application of Cryptology and Information Security, Dec 2019, Kobe, Japan. pp.196-223, ⟨10.1007/978-3-030-34578-5_8⟩. ⟨hal-02396738⟩

Record views