The need for electronic files, specifically computer programs or source code, to be traceable is widely recognized. Certain types of checksums, a form of digital signature, provide a practical and efficient method of accomplishing that. This paper will show the rationale for using the Cyclic Redundancy Check (CRC-32) and Adler-32 checksums and present a practical approach to help manage source code.
Notice of Proposed Rulemaking: Security and Electronic Signature Standards. Notice of Proposed Rulemaking Web site. Available at http://aspe.hhs.gov/admnsimp/nprm/sec01.htm. Accessed June 2002.
SarwateD. Computation of Cyclic Redundancy Checks Via Table Look-up. Commun ACM.1988; 31(8): 1008–1013.
6.
GeremiaP. Cyclic Redundancy Check Computation: An Implementation Using the TMS320C54x. Application Report SPRA530. Dallas, TX: Texas Instruments: April 1999.
7.
RamabadranTGaitondeS. A tutorial on CRC computations. IEEE Micro.1988: August: 62–75.
8.
WilliamsR. A Painless Guide to CRC Error Detection Algorithms.Hazelwood Park, Australia: Rocksoft Pty Ltd: 1993.
RivestR. The MD5 Message-Digest Algorithm. MIT Laboratory for Computer Science and RSA Data Security, Inc. Web site. Available at http://www.ietf.org/rfc/rfc1321.txt. Accessed June 2002.
15.
Tutorial on Reed-Solomon Error Correction Coding.MSC-21834. Houston TX: NASA.
