Bierbrauer, Jürgen; Gopalakrishnan, K.; Stinson, D. R. Bounds for resilient functions and orthogonal arrays. (English) Zbl 0939.94513 Desmedt, Yvo G. (ed.), Advances in cryptology - CRYPTO ’94. 14th annual international cryptology conference, Santa Barbara, CA, USA, August 21-25, 1994. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 839, 247-256 (1994). Summary: Orthogonal arrays (OAs) are basic combinatorial structures which appear under various disguises in cryptology and the theory of algorithms. Among their applications are universal hashing, authentication codes, resilient and correlation-immune functions, derandomization of algorithms, and perfect local randomizers. In this paper, we give new bounds on the size of orthogonal arrays using Delsarte’s linear programming method. Then we derive bounds on resilient functions and discuss when these bounds can be met.For the entire collection see [Zbl 0856.00052]. Cited in 6 Documents MSC: 94A60 Cryptography 05B15 Orthogonal arrays, Latin squares, Room squares 90C05 Linear programming Keywords:bounds; orthogonal arrays; Delsarte’s linear programming; resilient functions PDFBibTeX XMLCite \textit{J. Bierbrauer} et al., Lect. Notes Comput. Sci. 839, 247--256 (1994; Zbl 0939.94513)