Analysis and design of stream ciphers
Analysis and design of stream ciphers
Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
On Correlation-Immune Functions
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
The bit extraction problem or t-resilient functions
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
On Some Methods for Unconditionally Secure Key Distributionand Broadcast Encryption
Designs, Codes and Cryptography - Special issue: selected areas in cryptography I
Designs, Codes and Cryptography
Covering Sequences of Boolean Functions and Their Cryptographic Significance
Designs, Codes and Cryptography
Designs, Codes and Cryptography
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
Correlation immunity and resiliency of symmetric Boolean functions
Theoretical Computer Science
Highly Nonlinear Resilient Functions Through Disjoint Codes in Projective Spaces
Designs, Codes and Cryptography
Construction of t-resilient functions over a finite alphabet
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
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
More correlation-immune and resilient functions over Galois fields and Galois rings
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 |
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.