Abstract
The Cyclic Redundancy Check (CRC) is an efficient and widespread coding method to detect random errors in industrial and business data transmission. Because of its simple implementation and low residual error probability, it is also ap plied to data stored in digital memory. If no error occurred then the checksum (FCS, Frame Check Sequence) is consistent to the original data. Additionally, the actual value of the FCS is often used as a crite rion for e.g. the correct ver sion of the software in digital memories or to detect its manipulation. Although it is well known that data protected by CRC can be manipulated undetectably, CRC is applied for the detection of manipulations but not random errors. The paper demonstrates and proves in detail how easily data, like business software or video streams, can be manipulated such that the manipulation is not detectable even for CRC of high order.
Keywords
- Cyclic Redundancy Check
- checksum
- manipulation
- data transmission
- data storage
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-3-642-00205-2_13
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Peterson, W., Weldon, E.J.: Error Correcting Codes. MIT Press, Cambridge (1996)
MacWilliams, F.J., Sloane, N.J.: Theory of Error-Correcting Codes. North-Holland, Amsterdam (1991)
Blahut, R.E.: Algebraic Codes for Data Transmission. Cambridge University Press, Cambridge (2003)
Schiller, F., Mattes, T.: An Efficient Method to Evaluate CRC-Polynomials for Safety Critical Industrial Communication. Journ. of Appl. Computer Science 14, 57–80 (2006)
Koopman, P., Chakravarty, T.: Cyclic Redundancy Code (CRC) Polynomial Selection for Embedded Networks. In: DSN 2004, Florence, Italy, pp. 145–154 (2004)
Castagnoli, G.: On the Minimum Distance of Long Cyclic Codes and Cyclic Redundancy-Check Codes, ETH Zurich, Diss. No. 8979 (1989)
Schiller, F., Mattes, T.: Analysis of CRC-Polynomials for Safety-Critical Communication by Deterministic and Stochastic Automata, SAFEPROCESS, Beijing, China, pp. 1003–1008 (2006)
Wikipedia (2008), http://en.wikipedia.org/wiki/Cyclic_redundancy_check
Williams, R.N.: A Painless Guide to CRC Error Detection Algorithms. Rocksoft Pty Ltd., Hazelwood Park (1993)
International Electrotechnical Commission: IEC 61131-3, edn. 2.0 (2003)
Menezes, J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (2001)
Bellare, M., Rogaway, P.: Introduction to Modern Cryptography. Univ. of California (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schiller, F., Mattes, T., Weber, U., Mattes, R. (2009). Undetectable Manipulation of CRC Checksums for Communication and Data Storage. In: Bond, P. (eds) Communications and Networking in China. Chinacombiz 2008. Communications in Computer and Information Science, vol 26. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00205-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-00205-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00204-5
Online ISBN: 978-3-642-00205-2
eBook Packages: Computer ScienceComputer Science (R0)