Two Boolean functions are affine equivalent if one can be obtained from the other by applying an affine transformation to the input variables. For a long time, there have been efforts to investigate the affine equivalence of Boolean functions. Due to the complexity of the general problem, only affine equivalence under certain groups of permutations is usually considered. Boolean functions which are invariant under the action of cyclic rotation of the input variables are known as rotation symmetric (RS) Boolean functions. Due to their speed of computation and the prospect of being good cryptographic Boolean functions, this class of Boolean functions has received a lot of attention from cryptographic researchers. In this paper, we study affine equivalence for the simplest rotation symmetric Boolean functions, called MRS functions, which are generated by the cyclic permutations of a single monomial. Using Pólya’s enumeration theorem, we compute the number of equivalence classes, under certain large groups of permutations, for these MRS functions in any number n of variables. If n is prime, we obtain the number of equivalence classes under the group of all permutations of the variables.
4 May 2015 in Journal of Discrete Mathematical Sciences and Cryptography
There have been various attempts to attack reduced variants of Trivium stream cipher using cube attack. During the preprocessing phase of cube attack, we need to test the linearity of a superpoly. The linearity testing problem is to check whether a function is close to linear by asking oracle queries to the function. This is the BLR linearity test for Boolean functions, which has a time complexity of O(22k + c) cipher operations, where k is the length of the key and c is the size of the cube. In this paper we present a method which is supposed to be a sufficient condition for testing a superpoly for linearity in F2 with a time complexity O(2c + 1 (k2 + k)). Our analysis on Trivium cipher reduced to 576 rounds using cube attack gives 69 extremely sparse linearly independent linear equations for smaller cubes, which recovers 69 bits of the key and reduces the attack complexity in the online phase to 211.
Most of the image secret sharing schemes employ linear secret sharing such as Shamir's secret sharing scheme. Linear secret sharing threshold schemes are vulnerable to cheating problem (Tompa-Woll attack), where a participant can submit a false share and only he will be able to obtain the correct secret. Every Linear (k,n) threshold schemes are equivalent to some Maximum distance separable (MDS) codes. Finding more MDS linear codes is difficult and therefore finding more linear threshold schemes is not easy. In 1996, A.Renvall and C. Ding proposed a non-linear secret sharing scheme based on quadratic forms. In 2001 Pieprzyk and Zhang proposed a non linear scheme based on highly non linear balanced Boolean function. Even though work on nonlinear secret sharing schemes has been done on numbers, no significant work on images has been done so far. In this paper, concept of non-linear secret sharing scheme is extended to gray scale images. Experimental results concluded that non linear secret sharing can be applied for secret image sharing. It resists the Tompa-Woll attack and also able to retrieve the correct secret image, even if some of the shares are modified by a cheater.