Designs and their codes
Constructing single- and multi-output boolean functions with maximal algebraic immunity
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Designs, Codes and Cryptography
IEEE Transactions on Information Theory
On the nonlinearity of discrete logarithm in F2n
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
On equivalence classes of boolean functions
ICISC'10 Proceedings of the 13th 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
Designs, Codes and Cryptography
Hi-index | 0.06 |
The notion of algebraic immunity of Boolean functions has been generalized in several ways to vector-valued functions and/or over arbitrary finite fields and reasonable upper bounds for such generalized algebraic immunities has been proved in Armknecht and Krause (Proceedings of ICALP 2006, LNCS, vol. 4052, pp 180---191, 2006), Ars and Faugere (Algebraic immunity of functions over finite fields, INRIA, No report 5532, 2005) and Batten (Canteaut, Viswanathan (eds.) Progress in Cryptology--INDOCRYPT 2004, LNCS, vol. 3348, pp 84---91, 2004). In this paper we show that the upper bounds can be reached as the maximal values of algebraic immunities for most of generalizations by using properties of Reed---Muller codes.