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
Algebraic attacks on stream ciphers with linear feedback
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
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
Enumeration of 9-variable rotation symmetric boolean functions having nonlinearity 240
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
Results on algebraic immunity for cryptographically significant boolean functions
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Reducing the number of homogeneous linear equations in finding annihilators
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
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
Symmetric Boolean functions depending on an odd number of variables with maximum algebraic immunity
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
Construction of Rotation Symmetric Boolean Functions with Maximum Algebraic Immunity
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
On extended algebraic immunity
Designs, Codes and Cryptography
Secondary constructions of Boolean functions with maximum algebraic immunity
Cryptography and Communications
Designs, Codes and Cryptography
| Hi-index | 0.00 |
In this paper we present a theoretical construction of Rotation Symmetric Boolean Functions (RSBFs) on odd number of variables with maximum possible algebraic immunity (AI) and further these functions are not symmetric. Our RSBFs are of better nonlinearity than the existing theoretical constructions with maximum possible AI. To get very good nonlinearity, which is important for practical cryptographic design, we generalize our construction to a construction cum search technique in the RSBF class. We find 7, 9, 11 variable RSBFs with maximum possible AI having nonlinearities 56, 240, 984 respectively with very small amount of search after our basic construction.