Title: An efficient algorithm for computing Boolean function expressions of S-boxes

Authors: Lingguo Cui

Addresses: School of Information Science and Technology, Beijing Institute of Technology, Beijing 100081, Peoples Republic of China

Abstract: This paper attempts to address the problem of Boolean function expression calculation of S-boxes in block ciphers, which has been the algebraic basis of construction and evaluation of the secure S-boxes. By adopting the swap memory method (SMM), an efficient algorithm is developed to generate the Boolean function expressions directly from the truth tables. The algorithm exhibits a number of advantages such as conceptual simplicity, memory economy and applicability in handling multi-output problems. Furthermore, the algorithm can be executed in a parallel manner. A complete example is studied to illustrate the efficiency of the algorithm.

Keywords: Boolean function expressions; S-boxes; Reed-Muller expansions; swap memory method; block ciphers.

DOI: 10.1504/IJMIC.2009.024333

International Journal of Modelling, Identification and Control, 2009 Vol.6 No.2, pp.164 - 169

Available online: 31 Mar 2009 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article