On Binary Resilient Functions

Authors:
Xiang-Dong Hou
Affiliations:
Department of Mathematics and Statistics, Wright State University, Dayton, Ohio 45435 xhou@euler.math.wright.edu
Venue:
Designs, Codes and Cryptography
Year:
2003

Citing 5
Cited 0

Three characterizations of non-binary correlation-immune and resilient functions

Designs, Codes and Cryptography
Correlation-Immune and Resilient Functions Over a FiniteAlphabet and Their Applications in Cryptography

Designs, Codes and Cryptography
On Correlation-Immune Functions

CRYPTO '91 Proceedings of the 11th 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 nonlinear resilient functions

EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using a lifting formula for the coefficients of Boolean functions, we characterize binary resilient functions as binary matrices with certain row or column intersection properties. We give some new constructions of binary resilient functions based on this characterization. In particular, we show that the incidence matrix of a Steiner system can be used to construct binary resilient functions.