329 lines
8.0 KiB
Groff
329 lines
8.0 KiB
Groff
.\" $NetBSD: cksum.1,v 1.23 2003/08/07 11:13:20 agc Exp $
|
|
.\"
|
|
.\" Copyright (c) 1991, 1993
|
|
.\" The Regents of the University of California. All rights reserved.
|
|
.\"
|
|
.\" This code is derived from software contributed to Berkeley by
|
|
.\" the Institute of Electrical and Electronics Engineers, Inc.
|
|
.\"
|
|
.\" Redistribution and use in source and binary forms, with or without
|
|
.\" modification, are permitted provided that the following conditions
|
|
.\" are met:
|
|
.\" 1. Redistributions of source code must retain the above copyright
|
|
.\" notice, this list of conditions and the following disclaimer.
|
|
.\" 2. Redistributions in binary form must reproduce the above copyright
|
|
.\" notice, this list of conditions and the following disclaimer in the
|
|
.\" documentation and/or other materials provided with the distribution.
|
|
.\" 3. Neither the name of the University nor the names of its contributors
|
|
.\" may be used to endorse or promote products derived from this software
|
|
.\" without specific prior written permission.
|
|
.\"
|
|
.\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
.\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
.\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
.\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
.\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
.\" SUCH DAMAGE.
|
|
.\"
|
|
.\" @(#)cksum.1 8.2 (Berkeley) 4/28/95
|
|
.\"
|
|
.Dd October 18, 2002
|
|
.Dt CKSUM 1
|
|
.Os
|
|
.Sh NAME
|
|
.Nm cksum ,
|
|
.Nm md2 ,
|
|
.Nm md4 ,
|
|
.Nm md5 ,
|
|
.Nm sha1 ,
|
|
.Nm rmd160 ,
|
|
.Nm sum
|
|
.Nd display file checksums and block counts
|
|
.Sh SYNOPSIS
|
|
.Nm
|
|
.Op Fl n
|
|
.Oo
|
|
.Fl m |
|
|
.Fl 1 |
|
|
.Fl 2 |
|
|
.Fl 4 |
|
|
.Fl 5 |
|
|
.Fl 6 |
|
|
.Op Fl o Ar 1 | Ar 2
|
|
.Oc
|
|
.Op Ar
|
|
.Nm sum
|
|
.Op Ar
|
|
.Nm md2
|
|
.Op Fl n
|
|
.Op Fl p
|
|
.Op Fl t
|
|
.Op Fl x
|
|
.Op Fl s Ar string
|
|
.Op Ar
|
|
.Nm md4
|
|
.Op Fl n
|
|
.Op Fl p
|
|
.Op Fl t
|
|
.Op Fl x
|
|
.Op Fl s Ar string
|
|
.Op Ar
|
|
.Nm md5
|
|
.Op Fl n
|
|
.Op Fl p
|
|
.Op Fl t
|
|
.Op Fl x
|
|
.Op Fl s Ar string
|
|
.Op Ar
|
|
.Nm sha1
|
|
.Op Fl n
|
|
.Op Fl p
|
|
.Op Fl t
|
|
.Op Fl x
|
|
.Op Fl s Ar string
|
|
.Op Ar
|
|
.Nm rmd160
|
|
.Op Fl n
|
|
.Op Fl p
|
|
.Op Fl t
|
|
.Op Fl x
|
|
.Op Fl s Ar string
|
|
.Op Ar
|
|
.Sh DESCRIPTION
|
|
The
|
|
.Nm
|
|
utility writes to the standard output three whitespace separated
|
|
fields for each input file.
|
|
These fields are a checksum
|
|
.Tn 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.
|
|
.Pp
|
|
The
|
|
.Nm sum
|
|
utility is identical to the
|
|
.Nm
|
|
utility, except that it defaults to using historic algorithm 1, as
|
|
described below.
|
|
It is provided for compatibility only.
|
|
.Pp
|
|
The
|
|
.Nm md5
|
|
utility takes as input a message of arbitrary length and produces
|
|
as output a 128-bit
|
|
.Dq fingerprint
|
|
or
|
|
.Dq message digest
|
|
of the input.
|
|
It is conjectured that it is computationally infeasible
|
|
to product two messages having the same message digest, or to produce
|
|
any message having a given prespecified target message digest.
|
|
The
|
|
MD5 algorithm is intended for digital signature applications, where
|
|
a large file must be
|
|
.Dq compressed
|
|
in a secure manner before being encrypted with a private (secret)
|
|
key under a public-key encryption system such as
|
|
.Pa RSA .
|
|
.Pp
|
|
The
|
|
.Nm md2
|
|
and
|
|
.Nm md4
|
|
utilities behave in exactly the same manner as
|
|
.Nm md5
|
|
but use different algorithms.
|
|
.Pp
|
|
The
|
|
.Nm sha1
|
|
and
|
|
.Nm rmd160
|
|
utilities also produce message digests, however the output from these
|
|
two programs is 160 bits in length, as opposed to 128.
|
|
.Pp
|
|
The options are as follows:
|
|
.Bl -tag -width indent
|
|
.It Fl 1
|
|
Use the SHA1 algorithm rather than the default one.
|
|
.It Fl 2
|
|
Use the MD2 algorithm rather than the default one.
|
|
.It Fl 4
|
|
Use the MD4 algorithm rather than the default one.
|
|
.It Fl m | 5
|
|
Use the MD5 algorithm rather than the default one.
|
|
.It Fl 6
|
|
Use the RMD160 algorithm rather than the default one.
|
|
.It Fl o
|
|
Use historic algorithms instead of the (superior) default one.
|
|
.Pp
|
|
Algorithm 1 is the algorithm used by historic
|
|
.Bx
|
|
systems as the
|
|
.Xr sum 1
|
|
algorithm and by historic
|
|
.At V
|
|
systems as the
|
|
.Xr sum 1
|
|
algorithm when using the
|
|
.Fl r
|
|
option.
|
|
This is a 16-bit checksum, with a right rotation before each addition;
|
|
overflow is discarded.
|
|
.Pp
|
|
Algorithm 2 is the algorithm used by historic
|
|
.At V
|
|
systems as the
|
|
default
|
|
.Xr sum 1
|
|
algorithm.
|
|
This is a 32-bit checksum, and is defined as follows:
|
|
.Bd -unfilled -offset indent
|
|
s = sum of all bytes;
|
|
r = s % 2^16 + (s % 2^32) / 2^16;
|
|
cksum = (r % 2^16) + r / 2^16;
|
|
.Ed
|
|
.Pp
|
|
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.
|
|
.El
|
|
.Pp
|
|
The following options apply only when using the one of the message
|
|
digest algorithms:
|
|
.Bl -tag -width indent
|
|
.It Fl n
|
|
Print the hash and the filename in the normal sum output form, with
|
|
the hash at the left and the filename following on the right.
|
|
.It Fl p
|
|
Echo input from standard input to standard output, and append the
|
|
selected message digest.
|
|
.It Fl s Ar string
|
|
Print the hash of the given string
|
|
.Ar string .
|
|
.It Fl t
|
|
Run a built-in message digest time trial.
|
|
.It Fl x
|
|
Run a built-in message digest test script.
|
|
The tests that are run
|
|
are supposed to encompass all the various tests in the suites that
|
|
accompany the algorithms' descriptions with the exception of the the
|
|
last test for the SHA-1 algorithm and the RIPEMD-160 algorithm.
|
|
The
|
|
last test for these is one million copies of the lower letter a.
|
|
.El
|
|
.Pp
|
|
The default
|
|
.Tn CRC
|
|
used is based on the polynomial used for
|
|
.Tn CRC
|
|
error checking
|
|
in the networking standard
|
|
.St -iso8802-3 .
|
|
The
|
|
.Tn CRC
|
|
checksum encoding is defined by the generating polynomial:
|
|
.Pp
|
|
.Bd -unfilled -offset indent
|
|
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
|
|
.Ed
|
|
.Pp
|
|
Mathematically, the
|
|
.Tn CRC
|
|
value corresponding to a given file is defined by
|
|
the following procedure:
|
|
.Bd -filled -offset indent
|
|
The
|
|
.Ar n
|
|
bits to be evaluated are considered to be the coefficients of a mod 2
|
|
polynomial M(x) of degree
|
|
.Ar n Ns \-1 .
|
|
These
|
|
.Ar 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.
|
|
.Pp
|
|
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 \*[Le] 31.
|
|
.Pp
|
|
The coefficients of R(x) are considered to be a 32-bit sequence.
|
|
.Pp
|
|
The bit sequence is complemented and the result is the CRC.
|
|
.Ed
|
|
.Pp
|
|
The
|
|
.Nm
|
|
and
|
|
.Nm sum
|
|
utilities exit 0 on success, and \*[Gt]0 if an error occurs.
|
|
.Sh SEE ALSO
|
|
The default calculation is identical to that given in pseudo-code
|
|
in the following
|
|
.Tn ACM
|
|
article.
|
|
.Rs
|
|
.%T "Computation of Cyclic Redundancy Checks Via Table Lookup"
|
|
.%A Dilip V. Sarwate
|
|
.%J "Communications of the \\*(tNACM\\*(sP"
|
|
.%D "August 1988"
|
|
.Re
|
|
.Rs
|
|
.%A R. Rivest
|
|
.%T The MD2 Message-Digest Algorithm
|
|
.%O RFC 1319
|
|
.Re
|
|
.Rs
|
|
.%A R. Rivest
|
|
.%T The MD4 Message-Digest Algorithm
|
|
.%O RFC 1186 and RFC 1320
|
|
.Re
|
|
.Rs
|
|
.%A R. Rivest
|
|
.%T The MD5 Message-Digest Algorithm
|
|
.%O RFC 1321
|
|
.Re
|
|
.Rs
|
|
.%A U.S. DOC/NIST
|
|
.%T Secure Hash Standard
|
|
.%O FIPS PUB 180-1
|
|
.Re
|
|
.Sh STANDARDS
|
|
The
|
|
.Nm
|
|
utility is expected to conform to
|
|
.St -p1003.2-92 .
|
|
.Sh HISTORY
|
|
The
|
|
.Nm
|
|
utility appeared in
|
|
.Bx 4.4 .
|
|
The functionality for
|
|
.Nm md2 ,
|
|
.Nm md4 ,
|
|
.Nm sha1 ,
|
|
and
|
|
.Nm rmd160
|
|
was added in
|
|
.Nx 1.6 .
|
|
.\" .Pp
|
|
.\" The
|
|
.\" .Nm sum
|
|
.\" utility appeared in
|
|
.\" .Bx ?.?
|
|
.\" and
|
|
.\" .At V .
|