An efficient algorithm for computing Boolean function expressions of S-boxes
by Lingguo Cui
International Journal of Modelling, Identification and Control (IJMIC), Vol. 6, No. 2, 2009

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.

Online publication date: Tue, 31-Mar-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Modelling, Identification and Control (IJMIC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com