Abstract
Recent years have seen numerous examples where designs play an important role in the study of such topics in cryptography as secrecy and authentication codes, secret sharing schemes, correlation-immune and resilient functions. In this paper we give applications of some methods and results from the design theory, especially bounding the optimal size of the designs and codes, to cryptography. We give a new bound for the parameter t, when (n; T; t)-resilient functions and correlation-immune functions of order t exist. In the last section we present analogous bound for the parameter N of T-wise independent t-resilient function.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Bierbrauer, K. Gopalakrishnan, D.R. Stinson, Orthogonal arrays, resilient functions, error correcting codes and linear programming bounds, SIAM J.Discrete Math. 9, 1996, 424–452.
J. Bierbrauer, K. Gopalakrishnan, D.R. Stinson, A note on the duality of linear programming bounds for orthogonal arrays and codes, Bulletin of the ICA 22, 1998, 17–24.
P. Delsarte, An Algebraic Approach to Association Schemes in Coding Theory, Philips Research Reports Suppl., 10, 1973.
J. Friedman, On the bit extraction problem. Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1992, 314–319.
V.I. Levenshtein, Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces, IEEE Trans. Inf. Theory 41, 5, 1995, 1303–1321.
V.I. Levenshtein, Split orthogonal arrays and maximum independent resilient systems of functions, Designs, Codes and Cryptography 12, 1997, 131–160.
V.I. Levenshtein, Universal bounds for codes and designs, Chapter 6 in Handbook of Coding Theory, V. Pless and W.C. Huffman, 1998 Elsevier Science B.V., 449–648.
W.J. Martin, Mixed block designs, J.Combin.Designs 6, 2, 1998, 151–163.
W.J. Martin, Designs in product association schemes Designs, Codes and Cryptography 16, 3, 1999, 271–289.
S.I. Nikova, Bounds for designs in infinite polynomial metric spaces, Ph.D. Thesis, Eindhoven University of Technology, 1998.
S.I. Nikova, V.S. Nikov, Improvement of the Delsarte bound for τ-designs when it is not the best bound possible, submitted in Designs Codes and Cryptography.
S.I. Nikova, V.S. Nikov, Improvement of the Delsarte bound for τ-designs in finite polynomial metric space, to be published.
N.J.A. Sloane, J. Stufken, A linear programming bound for orthogonal arrays with mixed levels, J. Stat. Plan. Inf 56, 1996, 295–306.
D.R. Stinson, Resilient functions and large sets of orthogonal arrays,Congressus Numer. 92, 1993, 105–110.
F.J. MacWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes, North Holland, Amsterdam, 1977.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nikova⋆, S., Nikov, V. (1999). Some Applications of Bounds for Designs to the Cryptography. In: Walker, M. (eds) Cryptography and Coding. Cryptography and Coding 1999. Lecture Notes in Computer Science, vol 1746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46665-7_2
Download citation
DOI: https://doi.org/10.1007/3-540-46665-7_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66887-9
Online ISBN: 978-3-540-46665-9
eBook Packages: Springer Book Archive