An Upper Bound on the Number of m-Resilient Boolean Functions

Authors:
Claude Carlet;Aline Gouget
Affiliations:
-;-
Venue:
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Year:
2002

Citing 7
Cited 2

Enumerating boolean functions of cryptographic significance

Journal of Cryptology
Improving bounds for the number of correlation immune Boolean functions

Information Processing Letters
Enumeration of Correlation Immune Boolean Functions

ACISP '99 Proceedings of the 4th Australasian Conference on Information Security and Privacy
Nonlinearity Bounds and Constructions of Resilient Boolean Functions

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
A Note on the Construction and Upper Bounds of Correlation-Immune Functions

Proceedings of the 6th IMA International Conference on Cryptography and Coding
Decrypting a Class of Stream Ciphers Using Ciphertext Only

IEEE Transactions on Computers
The bit extraction problem or t-resilient functions

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science

On the confusion and diffusion properties of Maiorana-McFarland's and extended Maiorana-McFarland's functions

Journal of Complexity - Special issue on coding and cryptography
Equivalence classes of Boolean functions for first-order correlation

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

The enumeration of m-resilient Boolean functions in n variables would be a quite useful information for cryptography. But it seems to be an intractable open problem. Upper and lower bounds have appeared in the literature in the mid 80驴s. Since then, improving them has been the goal of several papers. In this paper, we give a new upper bound which partially improves upon all the known bounds.