Skip to main content
Springer Nature Link
Log in

On the construction of authentication and secrecy codes

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

We present several recursive constructions for authentication and secrecy codes using t-designs. These constructions are based on combinatorial structures called authentication perpendicular arrays, introduced by Stinson. As a by-product we obtain a method for constructing sets of permutations which are uniform and t-homogeneous for arbitrarily large t. A table of parameters for codes whose existence is known is included.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. W. O. Alltop, An infinite class of 4-designs,J. Combin. Theory, Vol. 6 (1969) pp. 320–322.

    Google Scholar 

  2. E. F. Assmus and J. D. Key, On an infinite class of Steiner systems witht=3 andk=6.J. Combin. Theory (A), Vol. 42 (1986) pp. 55–60.

    Google Scholar 

  3. T. Beth, D. Jungnickel, and H. Lenz,Design Theory, Bibliographisches Institut, Mannheim-Wien-Zürich (1985).

    Google Scholar 

  4. J. Bierbrauer,A new family of 4-designs, preprint.

  5. J. Bierbrauer, A family of 4-designs with block size 9,Discrete Math., to appear.

  6. J. Bierbrauer,Some friends of Alltop's designs 4−(2 f +1, 5, 5), preprint.

  7. J. Bierbrauer, Monotypical uniformly homogeneous sets of permutations,Arch. Math., Vol. 58 (1992) pp. 338–344.

    Google Scholar 

  8. J. Bierbrauer, A family of perpendicular arrays achieving perfect 4-fold secrecy,Proceedings of the 13th British Combinatorial Conference, to appear.

  9. J. Bierbrauer and Tran van Trung, HalvingPGL(2, 2 f),f odd: A series of cryptocodes,Designs, Codes and Cryptography, Vol. 1 (1991) pp. 141–148.

    Google Scholar 

  10. J. Bierbrauer and Tran van Trung, Some highly symmetric authentication perpendicular arrays,Designs, Codes and Cryptography, Vol. 1 (1992) pp. 307–319.

    Google Scholar 

  11. A. E. Brouwer, Thet-designs withv<18,Stichting Mathematisch Centrum, ZN 76/77.

  12. Y. M. Chee, C. J. Colbourn and D. L. Kreher, Simplet-designs withv≤30,Ars Combinatoria, Vol. 29 (1990) pp. 193–258.

    Google Scholar 

  13. R. H. F. Denniston, Some new 5-designs,Bull. London Math. Soc., Vol. 8 (1976) pp. 263–267.

    Google Scholar 

  14. M. J. Grannell and T. S. Griggs,A Steiner system S(5, 6, 108), preprint.

  15. H. Hanani, A class of three-designs,J. Combin. Theory (A), Vol. 26 (1979) pp. 1–19.

    Google Scholar 

  16. H. Hanani, A. Hartman and E. S. Kramer, On three-designs of small order,Discrete Math., Vol. 45 (1983) pp. 75–97.

    Google Scholar 

  17. D. R. Hughes, Ont-designs and groups,Amer. J. Math., Vol. 87 (1965) pp. 761–778.

    Google Scholar 

  18. D. Jungnickel and S. A. Vanstone, Hyperfactorizations of graphs and 5-designs,J. Univ. Kuwait (Sci.), Vol. 14 (1987) pp. 213–223.

    Google Scholar 

  19. E. S. Kramer, Somet-designs fort≥4 andv=17, 18,Proc. 6th S.E. Conf. Combinatorics, Graph Theory and Computing (Boca Raton 1975) Congressus Numerantium XIV, Utilitas Math. Publ., Winnipeg (1975) pp. 443–460.

  20. E. S. Kramer, D. L. Kreher, R. L. Rees and D. R. Stinson, On perpendicular arrays witht≥3,Ars Combinatoria, Vol. 28 (1989) pp. 215–223.

    Google Scholar 

  21. E. S. Kramer, S. S. Magliveras, Tran van Trung, and Qui-rong Wu, On the construction of some perpendicular arrays for arbitrarily larget, Discrete Math., Vol. 96 (1991) pp. 101–110.

    Google Scholar 

  22. C. C. Lindner, R. C. Mullin, and G. H. J. van Rees, Separable orthogonal arrays,Utilitas Math., Vol. 31 (1987) pp. 25–32.

    Google Scholar 

  23. R. Mathon, A new Steiner systemS(5, 6, 132), personal communication.

  24. W. H. Mills, A new 5-design,Ars Combinatoria, Vol. 6 (1978) pp. 193–195.

    Google Scholar 

  25. R. C. Mullin, P. J. Schellenberg, G. H. J. van Rees, and S. A. Vanstone, On the construction of perpendicular arrays,Utilitas Math., Vol. 18 (1980) pp. 141–160.

    Google Scholar 

  26. D. R. Stinson, Some constructions and bounds for authentication codes,J. Cryptology, Vol. 1 (1988) pp. 37–51.

    Google Scholar 

  27. D. R. Stinson, A construction for authentication/secrecy codes from certain combinatorial designs,J. Cryptology, Vol. 1 (1988) pp. 119–127.

    Google Scholar 

  28. D. R. Stinson, The combinatorics of authentication and secrecy codes,J. Cryptology, Vol. 2 (1990) pp. 23–49.

    Google Scholar 

  29. D. R. Stinson and L. Teirlinck, A construction for authentication/secrecy codes from 3-homogeneous permutation groups,European J. Combin., Vol. 11 (1990) pp. 73–79.

    Google Scholar 

  30. E. Witt, Über Steinersche Systeme,Abh. Math. Sem. Hamburg, Vol. 12 (1938) pp. 265–275.

    Google Scholar 

  31. Qui-rong Wu, On properties and constructions oft-designs, λ-designs and perpendicular arrays, Ph.D. dissertation, University of Nebraska-Lincoln (1991).

Download references

Author information

Authors and Affiliations

  1. Institute for Experimental Mathematics, University of Essen, Ellernstrasse 29, 45326, Essen, Germany

    Tran Trung Van

Authors
  1. Tran Trung Van
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Van Tran, T. On the construction of authentication and secrecy codes. Des Codes Crypt 5, 269–280 (1995). https://doi.org/10.1007/BF01388389

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01388389

Keywords

Search

Navigation