Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity
Designs, Codes and Cryptography
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Further properties of several classes of Boolean functions with optimum algebraic immunity
Designs, Codes and Cryptography
Algebraic attacks on stream ciphers with linear feedback
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Constructions of cryptographically significant boolean functions using primitive polynomials
IEEE Transactions on Information Theory
On the algebraic immunity of symmetric boolean functions
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
On some properties of self-reciprocal polynomials (Corresp.)
IEEE Transactions on Information Theory
Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
IEEE Transactions on Information Theory
A Note on Symmetric Boolean Functions With Maximum Algebraic Immunity in Odd Number of Variables
IEEE Transactions on Information Theory
On the Construction of Boolean Functions With Optimal Algebraic Immunity
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Recently, two classes of Boolean functions with optimal algebraic immunity have been proposed by Carlet et al. and Wang et al., respectively. Although it appears that their methods are very different, it is proved in this paper that the two classes of Boolean functions are in fact affine equivalent. Moreover, the number of affine equivalence classes of these functions is also studied.