Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in cryptology and the theory of algorithms. Among their applications are resilient and correlation-immune functions, derandomization of algorithms, random pattern testing of VLSI chips, authentication codes, universal hash functions, threshold schemes, and perfect local randomisers. This dissertation is a study of correlation-immune and resilient functions from a combinatorial point of view, emphasizing their connections to orthogonal arrays. An (n,m,t) resilient function is a function from n variables to m variables such that every possible output m-tuple is equally likely to occur when the values of t arbitrary inputs are fixed by an opponent ...
The only known general bounds on the parameters of orthogonal arrays are those given by Rao in 1947 ...
In recent years a cryptographic community is paying a lot of attention to the constructions of so ca...
Abstract. An (n, m, k)-resilient function is a function f: F n 2 → F m 2 such that every possible ou...
Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in ...
Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in ...
Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in ...
Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in...
A function f(X 1 ; X 2 ; : : : ; Xn ) is said to be t th-order correlation-immune if the random vari...
Boolean functions are used as nonlinear combining functions in certain stream ciphers. A Boolean fun...
This paper studies resilient functions which have applications in fault-tolerant distributed computi...
Recent years have seen numerous examples where designs play an important role in the study of such t...
A boolean function of n boolean variables is correlation-immune of order k if the function value is ...
Abstract. Orthogonal arrays (OAs) are basic combinatorial structures, originally studied by statisti...
Recent years have seen numerous examples when designs play an important role in the study of such to...
Recent years have seen numerous examples when designs play an important role in the study of such to...
The only known general bounds on the parameters of orthogonal arrays are those given by Rao in 1947 ...
In recent years a cryptographic community is paying a lot of attention to the constructions of so ca...
Abstract. An (n, m, k)-resilient function is a function f: F n 2 → F m 2 such that every possible ou...
Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in ...
Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in ...
Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in ...
Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in...
A function f(X 1 ; X 2 ; : : : ; Xn ) is said to be t th-order correlation-immune if the random vari...
Boolean functions are used as nonlinear combining functions in certain stream ciphers. A Boolean fun...
This paper studies resilient functions which have applications in fault-tolerant distributed computi...
Recent years have seen numerous examples where designs play an important role in the study of such t...
A boolean function of n boolean variables is correlation-immune of order k if the function value is ...
Abstract. Orthogonal arrays (OAs) are basic combinatorial structures, originally studied by statisti...
Recent years have seen numerous examples when designs play an important role in the study of such to...
Recent years have seen numerous examples when designs play an important role in the study of such to...
The only known general bounds on the parameters of orthogonal arrays are those given by Rao in 1947 ...
In recent years a cryptographic community is paying a lot of attention to the constructions of so ca...
Abstract. An (n, m, k)-resilient function is a function f: F n 2 → F m 2 such that every possible ou...