A Larger Class of Cryptographic Boolean Functions via a Study of the Maiorana-McFarland Construction
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
On Resilient Boolean Functions with Maximal Possible Nonlinearity
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Concatenating Indicators of Flats for Designing Cryptographic Functions
Designs, Codes and Cryptography
Construction of nonlinear boolean functions with important cryptographic properties
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Algebraic attacks on stream ciphers with linear feedback
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Results on algebraic immunity for cryptographically significant boolean functions
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity
Designs, Codes and Cryptography
Sequences, DFT and Resistance against Fast Algebraic Attacks
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
Some lower bounds on the algebraic immunity of functions given by their trace forms
Problems of Information Transmission
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Information Security and Cryptology --- ICISC 2008
Further properties of several classes of Boolean functions with optimum algebraic immunity
Designs, Codes and Cryptography
Probabilistic versus deterministic algebraic cryptanalysis: a performance comparison
IEEE Transactions on Information Theory
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
On extended algebraic immunity
Designs, Codes and Cryptography
Designs, Codes and Cryptography
IEEE Transactions on Information Theory
Upper bound for algebraic immunity on a subclass of Maiorana McFarland class of bent functions
Information Processing Letters
A note on fast algebraic attacks and higher order nonlinearities
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
On equivalence classes of boolean functions
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
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
Open problems related to algebraic attacks on stream ciphers
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
On bent and highly nonlinear balanced/resilient functions and their algebraic immunities
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Design principles for combiners with memory
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Upper bounds on algebraic immunity of boolean power functions
FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
Cryptography and Communications
Reducing the number of homogeneous linear equations in finding annihilators
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
On the higher order nonlinearities of algebraic immune functions
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
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
On exact algebraic [non-]immunity of s-boxes based on power functions
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
On algebraic immunity and annihilators
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
On the (im)possibility of practical and secure nonlinear filters and combiners
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
Characterisations of extended resiliency and extended immunity of s-boxes
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
A new method to construct Boolean functions with good cryptographic properties
Information Processing Letters
| Hi-index | 0.12 |
Algebraic attack has recently become an important tool in cryptanalysing different stream and block cipher systems. A Boolean function, when used in some cryptosystem, should be designed properly to resist this kind of attack. The cryptographic property of a Boolean function, that resists algebraic attack, is known as Algebraic Immunity ($\mathcal{AI}$). So far, the attempt in designing Boolean functions with required algebraic immunity was only ad-hoc, i.e., the functions were designed keeping in mind the other cryptographic criteria, and then it has been checked whether it can provide good algebraic immunity too. For the first time, in this paper, we present a construction method to generate Boolean functions on n variables with highest possible algebraic immunity ⌈n / 2⌉ . Such a function can be used in conjunction with (using direct sum) functions having other cryptographic properties. In a different direction we identify that functions, having low degree subfunctions, are weak in terms of algebraic immunity and analyse some existing constructions from this viewpoint.