A Brief Outline of Research on Correlation Immune Functions
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
Linear Codes in Constructing Resilient Functions with High Nonlinearity
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Nonlinear Vector Resilient Functions
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Bounds for Resilient Functions and Orthogonal Arrays
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
On Perfect and Adaptive Security in Exposure-Resilient Cryptography
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Autocorrelation Coefficients and Correlation Immunity of Boolean Functions
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Almost k-wise independent sample spaces and their cryptologic applications
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
On nonlinear resilient functions
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Characterisations of extended resiliency and extended immunity of s-boxes
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Hi-index | 0.00 |
Consider a coloring of the n-dimensional Boolean cube with c=2/sup s/ colors in such a way that every k-dimensional subcube is equicolored, i.e. each color occurs the same number of times. The author shows that for such a coloring one necessarily has (k-1)/nor= theta /sub c/=(c/2-1)/(c-1). This resolves the 'bit extraction' or 't-resilient functions' problem (also a special case of the privacy amplification problem) in many cases, such as c-1/n, proving that XOR type colorings are optimal, and always resolves this question to within c/4 in determining the optimal value of k (for any fixed n and c). He also studies the problem of finding almost equicolored colorings when (k-1)/n