On construction of resilient functions

An (n, m, t) resilient function is a function f: f0,1g n ?!f0,1g m such that every possible output m-tuple is equally likely to occur when the values of t arbitrary inputs are xed by an opponent and the remaining n ? t input bits are chosen independently at random. The existence of resilient functions has been largely studied in terms of lower and upper bounds. The construction of such functions which have strong cryptographic signiicance, however, needs to be studied further. This paper aims at presenting an eecient construction based on the theory of error-correcting codes, which can generate an innnite class of resilient functions having variant parameters from an old one. The method applies both to linear resilient functions and to nonlinear ones.