Abstract
We present simple and efficient hash functions applicable to secure authentication of information. The constructions are mainly intended for message authentication in systems implementing stream cipher encryption and are suitable for other applications as well. The proposed hash functions are implemented through linear feedback shift registers and therefore attractive for hardware applications. As an example, a single 64 bit LFSR will be used to authenticate 1 Gbit of information with a failure probability of less than 2−30. One of the constructions is the cryptographic version of the well known cyclic redundancy codes (CRC); the other is based on Toeplitz hashing where the matrix entries are generated by a LFSR. The later construction achieves essentially the same hashing and authentication strength of a completely random matrix but at a substantially lower cost in randomness, key size and implementation complexity. Of independent interest is our characterization of the properties required from a family of hash functions in order to be secure for authentication when combined with a (secure) stream cipher.
Chapter PDF
References
Noga Alon, Oded Goldreich, Johan Hastad, and Rene Peralta. Simple constructions of almost k-wise independent random variables. In 31th Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, pages 544–553, October 1990.
Bierbrauer J., Johansson T., Kabatianskii G., and Smeets, B., “On Families of Hash Functions via Geometric Codes and Concatenation”, Proc. of Crypto’93, pp. 331–342.
Birch, J., Christensen, L.G., and Skov, M., “A programmable 800 Mbit/s CRC check/generator unit for LANs and MANs”, Comp. Networks and ISDN Sys., 1992.
Brassard, G., “On computationally secure authentication tags requiring short secret shared keys”, Proc. of Crypto’82, pp.79–86.
Carter, J.L. and Wegman, M.N., “Universal Classes of Hash Functions”, JCSS, 18, 1979, pp. 143–154.
Desmedt, Y., “Unconditionally secure authentication schemes and practical and theoretical consequences”, Proc. of Crypto’ 85, pp.42–55.
Gemmell, P., and Naor, M., “Codes for Interactive Authentication”, Proc. of Crypto’ 93, pp. 355–367.
Gilbert, E.N., MacWilliams, F.J., and Sloane, N.J.A., “Codes which detect deception”, Bell Syst. Tech. J., Vol. 53, 1974, pp. 405–424.
John A Gordon, “Very simple method to find the minimal polynomial of an arbitrary non-zero element of a finite field”, Electronics Letters, Vol. 12, 1976, pp. 663–664.
Johansson T., “A Shift Register Construction of Unconditionally Secure Authentication Codes”, Design, Codes and Cryptography, 4, 1994, pp. 69–81.
Johansson T., Kabatianskii G., and Smeets, B., “On the Relation Between A-Codes and Codes Correcting Independent Errors”, Proc. of Eurocrypt’ 93, pp. 1–11.
Lai, X., Rueppel, R.A., and Woollven, J., “A Fast Cryptographic Checksum Algorithm Based on Stream Ciphers”, Auscrypt’ 92, pp. 339–348.
Lidl, R., and Niederreiter, H., “Finite Fields”, in Encyclopedia of Mathematics and Its Applications, Vol. 20, Reading, MA: Addison-Wesley, 1983.
Mansour, Y., Nisan, N., and Tiwari, P., “The Computational Complexity of Universal Hashing”, STOC’ 90, pp. 235–243.
Joseph Naor and Moni Naor. Small bias probability spaces: efficient construction and applications. In Proceedings of the 22 nd Annual ACM Symposium on Theory of Computing, Baltimore, Maryland, pages 213–223, May 1990.
Rabin, M.O., “Fingerprinting by Random Polynomials”, Tech. Rep. TR-15-81, Center for Research in Computing Technology, Harvard Univ., Cambridge, Mass., 1981.
Simmons, G.J., “Authentication theory/coding theory”, Proc. of Crypto’ 84, 411–431.
Simmons, G.J., “A Survey of Information Authentication”, in Gustavos J. Simmons, editor, Contemporary Cryptology, The Science of Information, IEEE Press, 1992.
Stinson, D.R., “Universal hashing and authentication codes”, Proc. of Crypto’ 91, pp. 74–85.
Taylor, R., “An integrity check value algorithm for stream ciphers”, Proc. of Crypto’93, pp. 40–48.
Wegman, M.N., and Carter, J.L., “New Hash Functions and Their Use in Authentication and Set Equality”, JCSS, 22, 1981, pp. 265–279.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krawczyk, H. (1994). LFSR-based Hashing and Authentication. In: Desmedt, Y.G. (eds) Advances in Cryptology — CRYPTO ’94. CRYPTO 1994. Lecture Notes in Computer Science, vol 839. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48658-5_15
Download citation
DOI: https://doi.org/10.1007/3-540-48658-5_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58333-2
Online ISBN: 978-3-540-48658-9
eBook Packages: Springer Book Archive