Classification of Boolean functions with respect to linear equivalence

Rok, strany: 2006, 123 - 135

S-boxes are usually the only source of nonlinearity of block ciphers. So it is obvious that they should have good cryptographic properties. The linear and affine nonequivalence of the S-box coordinate functions is one of them. In this paper we consider linear equivalence of Boolean functions. It could be described as group $GL(n,2)$ action on the set of Boolean functions. We show how to derive the number of $GL(n,2)$-orbits in the set of all Boolean functions and some of its proper subsets.

ISO 690:

Serweciński, M. 2006. Classification of Boolean functions with respect to linear equivalence. In Tatra Mountains Mathematical Publications, vol. 33, no.1, pp. 123-135. 1210-3195.

APA:

Serweciński, M. (2006). Classification of Boolean functions with respect to linear equivalence. Tatra Mountains Mathematical Publications, 33(1), 123-135. 1210-3195.