S-box, SET, Match: A Toolbox for S-box Analysis

Abstract : Boolean functions and substitution boxes (S-boxes) represent the only nonlinear part in many algorithms and therefore play the crucial role in their security. Despite the fact that some algorithms today reuse theoretically secure and carefully constructed S-boxes, there is a clear need for a tool that can analyze security properties of S-boxes and hence the corresponding primitives. This need is especially evident in the scenarios where the goal is to create new S-boxes. Even in the cases when some common properties of S-boxes are known, we believe it is prudent to exhaustively investigate all possible sets of cryptographic properties. In this paper we present a tool for the evaluation of Boolean functions and S-boxes suitable for cryptography.
Document type :
Conference papers
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/hal-01400936
Contributor : Hal Ifip <>
Submitted on : Tuesday, November 22, 2016 - 4:23:49 PM
Last modification on : Wednesday, November 23, 2016 - 8:47:43 AM
Long-term archiving on : Tuesday, March 21, 2017 - 1:28:46 AM

File

978-3-662-43826-8_10_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Stjepan Picek, Lejla Batina, Domagoj Jakobović, Barış Ege, Marin Golub. S-box, SET, Match: A Toolbox for S-box Analysis. 8th IFIP International Workshop on Information Security Theory and Practice (WISTP), Jun 2014, Heraklion, Crete, Greece. pp.140-149, ⟨10.1007/978-3-662-43826-8_10⟩. ⟨hal-01400936⟩

Share

Metrics

Record views

278

Files downloads

1618