Some Applications of Bounds for Designs to the Cryptography

  • Svetla Nikova⋆
  • Ventsislav Nikov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1746)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    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.zbMATHMathSciNetGoogle Scholar
  3. 3.
    P. Delsarte, An Algebraic Approach to Association Schemes in Coding Theory, Philips Research Reports Suppl., 10, 1973.Google Scholar
  4. 4.
    J. Friedman, On the bit extraction problem. Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1992, 314–319.Google Scholar
  5. 5.
    V.I. Levenshtein, Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces, IEEE Trans. Inf. Theory 41, 5, 1995, 1303–1321.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    V.I. Levenshtein, Split orthogonal arrays and maximum independent resilient systems of functions, Designs, Codes and Cryptography 12, 1997, 131–160.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    W.J. Martin, Mixed block designs, J.Combin.Designs 6, 2, 1998, 151–163.zbMATHCrossRefGoogle Scholar
  9. 9.
    W.J. Martin, Designs in product association schemes Designs, Codes and Cryptography 16, 3, 1999, 271–289.zbMATHCrossRefGoogle Scholar
  10. 10.
    S.I. Nikova, Bounds for designs in infinite polynomial metric spaces, Ph.D. Thesis, Eindhoven University of Technology, 1998.Google Scholar
  11. 11.
    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.Google Scholar
  12. 12.
    S.I. Nikova, V.S. Nikov, Improvement of the Delsarte bound for τ-designs in finite polynomial metric space, to be published.Google Scholar
  13. 13.
    N.J.A. Sloane, J. Stufken, A linear programming bound for orthogonal arrays with mixed levels, J. Stat. Plan. Inf 56, 1996, 295–306.zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    D.R. Stinson, Resilient functions and large sets of orthogonal arrays,Congressus Numer. 92, 1993, 105–110.MathSciNetGoogle Scholar
  15. 15.
    F.J. MacWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes, North Holland, Amsterdam, 1977.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Svetla Nikova⋆
  • Ventsislav Nikov
    • 1
  1. 1.Department of Mathematics and InformaticsVeliko Tarnovo UniversityVeliko TarnovoBulgaria

Personalised recommendations