摘要
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.
源语言 | 英语 |
---|---|
页(从-至) | 164-169 |
页数 | 6 |
期刊 | International Journal of Modelling, Identification and Control |
卷 | 6 |
期 | 2 |
DOI | |
出版状态 | 已出版 - 2009 |
指纹
探究 'An efficient algorithm for computing Boolean function expressions of S-boxes' 的科研主题。它们共同构成独一无二的指纹。引用此
Cui, L. (2009). An efficient algorithm for computing Boolean function expressions of S-boxes. International Journal of Modelling, Identification and Control, 6(2), 164-169. https://doi.org/10.1504/IJMIC.2009.024333