Abstract
In this paper, we propose classes of Message Authentication Codes (MAC) based on error correcting-codes. We introduce a new notion of error tolerant forgery of hash messages. These MACs allow full error recovery for all applications, while being error-tolerant for less information-sensitive applications. The classes of the keyed hash functions are highly secure, and provide the capabilities of correcting errors on transmission, including burst-errors, which is a typical phenomenon in wireless communications. These classes of hash functions are easily implementable in hardware by means of simple linear feedback shift register structures.
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
E.R. Berlekamp, Algebraic coding theory, McGraw-Hill, New York, 1968.
R.E. Blahut, Theory and Practice of Error Control Codes, Addison-Wesley Publishing Co., May 1984.
A. Chang, P. Gaal, S.W. Golomb, G. Gong, T. Helleseth, P.V. Kumar, On a Conjectured Ideal Autocorrelation Sequence and a Related Triple-Error Correcting Cyclic Code, IEEE Trans. Information Theory, Vol. 46, No. 2, March 2000.
S.W. Golomb, Shift Register Sequences, Holden-Day, Inc., 1967. Revised edition, Aegean Park Press, 1982.
IEEE P1363, Standard Specifications For Public Key Cryptography, 2000.
J.H. Jeng and T.K. Truong, on Decoding of Both Errors and Erasures of a Reed-Solomon Code Using an Inverse-Free Berlekamp-Massey Algorithm, IEEE Transactions on Communications, Vol. 47, No. 10, October 1999, 1488–1494.
H. Krawczyk, LFSR-based Hashing and Authentication, Advances in Cryptology-Crypto’ 94, Lecture Notes in Computer Science, LNCS 839(1994), Springer-Verlag, 129–139.
F.J. MacWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland Publishing Company, 1977.
A.J. Menezes, P.C. van Oorschot, S.A. Vanstone, Handbook of Applied Cryptography, CRC Press, 1997.
S.A. Vanstone, P.C. van Oorschot, An Introduction to Error Correcting Codes with Applications, Kluwer Academic Publishers, 1989.
E. Bach, J. Shallit, Algorithmic Number Theory, MIT Press, Cambridge, Massachusetts, 1996.
T.K. Truong, J.H. Jeng, I.S. Reed, Fast Algorithm for Computing the Roots of Error Locator Polynomials up to Degree 11 in Reed-Solomon Decoders, IEEE Transactions on Communications, Vol. 49, No. 5, May 2001, 779–783.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lam, C.C.Y., Gong, G., Vanstone, S.A. (2002). Message Authentication Codes with Error Correcting Capabilities. In: Deng, R., Bao, F., Zhou, J., Qing, S. (eds) Information and Communications Security. ICICS 2002. Lecture Notes in Computer Science, vol 2513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36159-6_30
Download citation
DOI: https://doi.org/10.1007/3-540-36159-6_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00164-5
Online ISBN: 978-3-540-36159-6
eBook Packages: Springer Book Archive