Enumerating boolean functions of cryptographic significance
Journal of Cryptology
Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity
Designs, Codes and Cryptography
Linear structures of symmetric functions over finite fields
Information Processing Letters
Fast S-box security mechanism research based on the polymorphic cipher
Information Sciences: an International Journal
On the algebraic immunity of symmetric boolean functions
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Maximum nonlinearity of symmetric Boolean functions on odd number of variables
IEEE Transactions on Information Theory
Resilient functions over finite fields
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Balanced Symmetric Functions Over
IEEE Transactions on Information Theory
Information Sciences: an International Journal
Enumeration of balanced symmetric functions over GF(p)
Information Processing Letters
Enhanced count of balanced symmetric functions and balanced alternating functions
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Hi-index | 0.07 |
The lower bound on the number of n-variable balanced symmetric functions over finite fields GF(p) presented by Cusick et al. in [T.W. Cusick, Y. Li, P. Sta@?nica@?, Balanced symmetric functions over GF(p), IEEE Trans. Inform. Theory 54 (3) (2008) 1304-1307] is improved in this paper. An equivalent characterization is also presented for the general case.