期刊名称：International Journal of Security and Its Applications
印刷版ISSN：1738-9976
出版年度：2012
卷号：6
期号：2
出版社：SERSC
摘要：Substitution boxes are among the most critical components of a secure block cipher de- sign. A substitution box or, for short, SBox, is a set of Boolean functions implementing a nonlinear mapping of inputs to outputs and it is employed for mixing the input of the cipher with the encryption key so that the output of the cipher reveals no information about the encryption key. Over the years, a number of good practices have evolved that, if employed, can lead to the construction of SBoxes with good security properties that lead to the cipher’s resistance against known and envisaged cryptanalysis techniques. One such practice is the employment of particular classes of Boolean functions that possess a number of desirable properties. A drawback of such an approach is that it is frequently a computationally de- manding task to check that the employed Boolean functions and the resulting SBox have the target properties. In this paper we describe a distributed algorithm that can accelerate significantly the construction of SBoxes with desirable cryptographic properties. The algo- rithm has been implemented on a computer cluster and it is fully parametric, with respect to the type of Boolean functions it can use as constituents of the SBox. A designer can use a class of Boolean functions with algorithmically definable properties in order to produce SBoxes of arbitrary sizes. We also present evidence for the algorithm’s efficiency by compar- ing it with the best sequential approach available in a series of different experimental setups.
关键词：Symmetric Block Ciphers; Distributed SBox Computation; Nonlinearity; SAC;criterion; Bent Functions; Almost Perfect Nonlinear functions; Computing Cluster.
