Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity
Designs, Codes and Cryptography
Rotation symmetric Boolean functions-Count and cryptographic properties
Discrete Applied Mathematics
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Algebraic attacks on stream ciphers with linear feedback
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Designs, Codes and Cryptography
IEEE Transactions on Information Theory
Construction and analysis of boolean functions of 2t+1 variables with maximum algebraic immunity
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Efficient computation of algebraic immunity for algebraic and fast algebraic attacks
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Search for Boolean Functions With Excellent Profiles in the Rotation Symmetric Class
IEEE Transactions on Information Theory
On the Construction of Boolean Functions With Optimal Algebraic Immunity
IEEE Transactions on Information Theory
Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions
IEEE Transactions on Information Theory
On the resistance of boolean functions against fast algebraic attacks
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Perfect algebraic immune functions
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
| Hi-index | 0.04 |
In this paper, an efficient algorithm is proposed to estimate the immunity of rotation symmetric Boolean functions against fast algebraic attacks. The algorithm is true-biased and almost always outputs the correct answer. Besides, it is shown that an n-variable rotation symmetric Boolean function f with n even but not a power of 2 admits a rotation symmetric function g of degree at most e@?n/3 such that the product gf has degree at most n-e-1.