10-05-2004
MD5 is great, but a CRC is pretty good too. And you probably have the program cksum that can compute CRC's for you. cksum outputs two numbers: a byte count and a crc-32. I capture both numbers and check them both.
Either way, this must start before the tape is made. On the source system, you need to do a cksum on some files and send the ouput to a text file. Then you tar up your files together with this text file. Once you untar the files on the destination system, you rerun cksum and compare the results to the text file.
10 More Discussions You Might Find Interesting
1. SCO
Does anyone know the answer to this?
When I run "sum -r" on a file that I've down loaded from the sco website, the 1st set of numbers differs from the checksum on the download page but the
2nd set matches.
If I try to install the patch, I get errors.
Anyone has an answer? (3 Replies)
Discussion started by: jn5519
3 Replies
2. Solaris
Anyone can tell me the different between "cksum" and "sum" command on Solaris? I read the man pages but still not get it.
And how to display the md5 checksum for a file.
Thanks, (1 Reply)
Discussion started by: redstone
1 Replies
3. Shell Programming and Scripting
Dear experts,
I have an epoch time input file such as : -
1302451209564
1302483698948
1302485231072
1302490805383
1302519244700
1302492787481
1302505299145
1302506557022
1302532112140
1302501033105
1302511536485
1302512669550
I need the epoch time above to be converted into real... (4 Replies)
Discussion started by: aismann
4 Replies
4. Shell Programming and Scripting
Hi ALL,
I use solaris OS and SFTP to get/put files from remote server.I use the below command ,
sftp user@host<<EOF
cd "dir"
get --checksum "filename"
EOF
I am getting a strange error as " get --checksum INVALID paramter". It has been working succesfully since last 3 years but all of a... (1 Reply)
Discussion started by: mohanpadamata
1 Replies
5. IP Networking
Hello
I am communicating with two devices using my computer over UDP protocol. The application is running fine. When I monitored the UDP traffic using Wireshark software, I found that there were too many Checksum errors.
Please find attached the png file showing this error. I am about to... (0 Replies)
Discussion started by: AustinCann
0 Replies
6. Shell Programming and Scripting
Hi ,
I am trying to :wall: my head while scripting ..I am really new to this stuff , never did it before :( .
how to find cpu's system high time and user time high in a script??
thanks , help would be appreciated !
:) (9 Replies)
Discussion started by: sushwey
9 Replies
7. Shell Programming and Scripting
Hi
I have an ftp script which works fine when i execute through a test scheduler(UC4), but when i run it through the prod scheduler(UC4), it hungs indefinetely, when we cancel the job and re-run it it works perfectly fine. here is the code,, any idea why this is happening ????
... (1 Reply)
Discussion started by: selvankj
1 Replies
8. Shell Programming and Scripting
hi all i want a script to FTP a file and should generate a quality checksum file
means when I FTP a file from one server to another server it should generate a QC file which should contain timestamp,no.of records in that file
Thanks in advance
saikumar (3 Replies)
Discussion started by: hemanthsaikumar
3 Replies
9. Shell Programming and Scripting
is there a way to get a script to do a checksum on itself?
something like this:
#!/bin/sh
myexpectedsig=$(cksum $0 | awk '{print $1}')
if ; then
exit
else
who
uptime
date
fi
im looking for something that would always represent the running script, which is why im... (6 Replies)
Discussion started by: SkySmart
6 Replies
10. UNIX for Beginners Questions & Answers
Hi Folks,
I need a UNIX script which will copy files(Table wise) from source directory to destination directory (Under table directory) and also creates 2 additional files after getting copied to destination directory with extension .pdy and .ldy , . pdy file will be zero byte file should get... (4 Replies)
Discussion started by: Nicks1412
4 Replies
CKSUM(1) BSD General Commands Manual CKSUM(1)
NAME
cksum, sum -- display file checksums and block counts
SYNOPSIS
cksum [-o 1 | 2 | 3] [file ...]
sum [file ...]
DESCRIPTION
The cksum utility writes to the standard output three whitespace separated fields for each input file. These fields are a checksum CRC, the
total number of octets in the file and the file name. If no file name is specified, the standard input is used and no file name is written.
The sum utility is identical to the cksum utility, except that it defaults to using historic algorithm 1, as described below. It is provided
for compatibility only.
The options are as follows:
-o Use historic algorithms instead of the (superior) default one.
Algorithm 1 is the algorithm used by historic BSD systems as the sum(1) algorithm and by historic AT&T System V UNIX systems as the
sum(1) algorithm when using the -r option. This is a 16-bit checksum, with a right rotation before each addition; overflow is dis-
carded.
Algorithm 2 is the algorithm used by historic AT&T System V UNIX systems as the default sum(1) algorithm. This is a 32-bit checksum,
and is defined as follows:
s = sum of all bytes;
r = s % 2^16 + (s % 2^32) / 2^16;
cksum = (r % 2^16) + r / 2^16;
Algorithm 3 is what is commonly called the '32bit CRC' algorithm. This is a 32-bit checksum.
Both algorithm 1 and 2 write to the standard output the same fields as the default algorithm except that the size of the file in
bytes is replaced with the size of the file in blocks. For historic reasons, the block size is 1024 for algorithm 1 and 512 for
algorithm 2. Partial blocks are rounded up.
The default CRC used is based on the polynomial used for CRC error checking in the networking standard ISO/IEC 8802-3:1989. The CRC checksum
encoding is defined by the generating polynomial:
G(x) = x^32 + x^26 + x^23 + x^22 + x^16 + x^12 +
x^11 + x^10 + x^8 + x^7 + x^5 + x^4 + x^2 + x + 1
Mathematically, the CRC value corresponding to a given file is defined by the following procedure:
The n bits to be evaluated are considered to be the coefficients of a mod 2 polynomial M(x) of degree n-1. These n bits are the bits
from the file, with the most significant bit being the most significant bit of the first octet of the file and the last bit being the
least significant bit of the last octet, padded with zero bits (if necessary) to achieve an integral number of octets, followed by one
or more octets representing the length of the file as a binary value, least significant octet first. The smallest number of octets
capable of representing this integer are used.
M(x) is multiplied by x^32 (i.e., shifted left 32 bits) and divided by G(x) using mod 2 division, producing a remainder R(x) of degree
<= 31.
The coefficients of R(x) are considered to be a 32-bit sequence.
The bit sequence is complemented and the result is the CRC.
EXIT STATUS
The cksum and sum utilities exit 0 on success, and >0 if an error occurs.
SEE ALSO
md5(1)
The default calculation is identical to that given in pseudo-code in the following ACM article.
Dilip V. Sarwate, "Computation of Cyclic Redundancy Checks Via Table Lookup", Communications of the ACM, August 1988.
STANDARDS
The cksum utility is expected to conform to IEEE Std 1003.2-1992 (``POSIX.2'').
HISTORY
The cksum utility appeared in 4.4BSD.
BSD
April 28, 1995 BSD