Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Extremal Generalized S--Boxes

In: Computing and Informatics, vol. 22, no. 1
O. Grošek - L. Satko - K. Nemoga

Details:

Year, pages: 2003, 85 - 99
About article:
It is well known that there does not exist a Boolean function f: Z_2^m ightarrow Z_2^n satisfying both basic cryptologic criteria, balancedness and perfect nonlinearity. In /9/ it was shown that, if we use as a domain quasigroup G instead of the group Z_2^n, one can find functions which are at the same time balanced and perfectly nonlinear. Such functions have completely flat difference table. We continue in our previous work, but we turn our attention to the worst case when all lines of Cayley table of G define so called linear structure of f (/5/). We solve this problem in both directions: We describe all such bijections f:G ightarrow Z_2^n, for a given quasigroup |G|=2^n, and describe such quasigroups for a given function f.
How to cite:
ISO 690:
Grošek, O., Satko, L., Nemoga, K. 2003. Extremal Generalized S--Boxes. In Computing and Informatics, vol. 22, no.1, pp. 85-99. 1335-9150.

APA:
Grošek, O., Satko, L., Nemoga, K. (2003). Extremal Generalized S--Boxes. Computing and Informatics, 22(1), 85-99. 1335-9150.