skip to main content
10.1145/217382.217413acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free Access

Performance of checksums and CRCs over real data

Published:01 October 1995Publication History

ABSTRACT

Checksum and CRC algorithms have historically been studied under the assumption that the data fed to the algorithms was entirely random. This paper examines the behavior of checksums and CRCs over real data from various UNIX® file systems. We show that, when given real data in small to modest pieces (e.g., 48 bytes), all the checksum algorithms have skewed distributions. In one dramatic case, 0.01% of the check values appeared nearly 19% of the time. These results have implications for CRCs and checksums when applied to real data. They also cause a spectacular failure rate for the both TCP and Fletcher's checksums when trying to detect certain types of packet splices.

References

  1. 1.J. Fletcher, "An Arithmetic Checksum for Serial Transmissions,'' IEEE Trans. on Communication, Vol. 30, No. 1, January 1982, pp. 247-252.]]Google ScholarGoogle ScholarCross RefCross Ref
  2. 2.Z. Wang and J. Crowcroft, "SEAL Detects Cell Misordering," IEEE Network Magazine, Vol. 6, No. 4, July 1992, pp. 8-19.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.D. Greene and B. Lyles, "Reliability of Adaptation Layers," Protocols for High-Speed Networks, III (Proc. IFIP 6.1/6.4 Workshop), ed. B. Pehrson, P. Gunningberg, and S. Pink, 1992.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.J. Postel, '~Transmission Control Protocol," Internet Request for Comments No. 793, September 1981.]]Google ScholarGoogle Scholar
  5. 5.R. Braden, D. Borman, and C. Partridge, "Computing the Internet Checksum", Internet Request for Comments No. 1071, September 1988. (Updated by RFCs 1141 and 1624).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.Joseph L. Hammond, Jr, et al., "Development of a Transmission Error Model and an Error Control Model," Georgia Institute of Technology, prepared for Rome Air Development Center, May 1975.]]Google ScholarGoogle Scholar
  7. 7.William W. Plummer, "TCP Checksum Function Design," Internet Engineering Note No. 45, June 1978. Reprinted in reference {5}.]]Google ScholarGoogle Scholar
  8. 8.Anastase Nakassis, "Fletcher's Error Detection Algorithm: How to implement it efficientlyy and how to avoid the most common pitfalls," ACM SIGCOMM Computer Communication Review, Vol. 18, No. 5, October 1988, pp. 63-88.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.Keith Sklower, "Improving the Efficiency of the OSI Checksum Calculation," ACM SIGCOMM Computer Communication Review, Vol. 19, No. 5, October 1989, pp. 44-55.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Performance of checksums and CRCs over real data

                Recommendations

                Comments

                Login options

                Check if you have access through your login credentials or your institution to get full access on this article.

                Sign in
                • Published in

                  cover image ACM Conferences
                  SIGCOMM '95: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
                  October 1995
                  372 pages
                  ISBN:0897917111
                  DOI:10.1145/217382
                  • cover image ACM SIGCOMM Computer Communication Review
                    ACM SIGCOMM Computer Communication Review  Volume 25, Issue 4
                    Oct. 1995
                    345 pages
                    ISSN:0146-4833
                    DOI:10.1145/217391
                    • Editor:
                    • David Oran
                    Issue’s Table of Contents

                  Copyright © 1995 ACM

                  Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                  Publisher

                  Association for Computing Machinery

                  New York, NY, United States

                  Publication History

                  • Published: 1 October 1995

                  Permissions

                  Request permissions about this article.

                  Request Permissions

                  Check for updates

                  Qualifiers

                  • Article

                  Acceptance Rates

                  SIGCOMM '95 Paper Acceptance Rate30of143submissions,21%Overall Acceptance Rate554of3,547submissions,16%

                PDF Format

                View or Download as a PDF file.

                PDF

                eReader

                View online with eReader.

                eReader