Skip to main content
SpringerLink
Log in

A shift register construction of unconditionally secure authentication codes

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

Abstract

We consider the authentication problem, using the model described by Simmons. Several codes have been constructed using combinatorial designs and finite geometries. We introduce a new way of constructing authentication codes using LFSR-sequences. A central part of the construction is an encoding matrix derived from these LFSR-sequences. Necessary criteria for this matrix in order to give authentication codes that provides protection aginst impersonation and substitution attacks will be given. These codes also provide perfect secrecy if the source states have a uniform distribution. Moreover, the codes give a natural splitting of the key into two parts, one part used aginst impersonation attacks and a second part used against substitution attacks and for secrecy simultaneously. Since the construction is based on the theory of LFSR-sequences it is very suitable for implementation and a simple implementation of the construction is given.

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

Access this article

Log in via an institution

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. Gilbert, E. N., MacWilliams, F.J. and Sloane, N.J.A. 1974. Codes which detect deception.Bell Syst. Tech. J., 53:405–424.

    Google Scholar 

  2. Simmons, G.J. 1985. Authentication theory/coding theory. InAdvances in Cryptology, Proceedings of CRYPTO 84. G.R. Blakley and D. Chaum, eds. Lecture notes in Computer Science, No. 196. New York, NY: Springer, pp. 411–431.

    Google Scholar 

  3. Stinson, D.R. 1988. Some constructions and bounds for authentication codes.Journal of Crypotology. 1:37–51.

    Google Scholar 

  4. De Soete, M. 1988. Some constructions for authentication-secrecy codes. Eurocrypt'88, Davos, Switzerland, May 25–27.Advances in Cryptology-Eurocrypt '88, ed. C.G. Günther, Berlin: Springer-Verlag, pp. 58–75.

    Google Scholar 

  5. Smeets, B., Vanroose, P., and Wan, Zhe-Xian. 1990. On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of orderL≥2.Proceedings Eurocrypt 1990. Aarhus, Denmark, pp. 306–312.

  6. Beth, T., Jungnickel, D., and Lenz, H. 1986.Design Theory. Cambridge: Cambridge University Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Theory, Lund University, Box 118, S-221 00, Lund, Sweden

    Thomas Johansson

Authors
  1. Thomas Johansson
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by D. Jungnickel

Rights and permissions

Reprints and permissions

About this article

Cite this article

Johansson, T. A shift register construction of unconditionally secure authentication codes. Des Codes Crypt 4, 69–81 (1994). https://doi.org/10.1007/BF01388561

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation