md5.1 (267667) | md5.1 (292782) |
---|---|
1.\" $FreeBSD: head/sbin/md5/md5.1 267667 2014-06-20 09:40:43Z bapt $ 2.Dd May 17, 2014 | 1.\" $FreeBSD: head/sbin/md5/md5.1 292782 2015-12-27 17:33:59Z allanjude $ 2.Dd October 17, 2015 |
3.Dt MD5 1 4.Os 5.Sh NAME | 3.Dt MD5 1 4.Os 5.Sh NAME |
6.Nm md5 , sha1 , sha256 , sha512, rmd160 | 6.Nm md5 , sha1 , sha256 , sha384 , sha512, rmd160 |
7.Nd calculate a message-digest fingerprint (checksum) for a file 8.Sh SYNOPSIS 9.Nm md5 10.Op Fl pqrtx 11.Op Fl c Ar string 12.Op Fl s Ar string 13.Op Ar 14.Nm sha1 15.Op Fl pqrtx 16.Op Fl c Ar string 17.Op Fl s Ar string 18.Op Ar 19.Nm sha256 20.Op Fl pqrtx 21.Op Fl c Ar string 22.Op Fl s Ar string 23.Op Ar | 7.Nd calculate a message-digest fingerprint (checksum) for a file 8.Sh SYNOPSIS 9.Nm md5 10.Op Fl pqrtx 11.Op Fl c Ar string 12.Op Fl s Ar string 13.Op Ar 14.Nm sha1 15.Op Fl pqrtx 16.Op Fl c Ar string 17.Op Fl s Ar string 18.Op Ar 19.Nm sha256 20.Op Fl pqrtx 21.Op Fl c Ar string 22.Op Fl s Ar string 23.Op Ar |
24.Nm sha384 25.Op Fl pqrtx 26.Op Fl c Ar string 27.Op Fl s Ar string 28.Op Ar |
|
24.Nm sha512 25.Op Fl pqrtx 26.Op Fl c Ar string 27.Op Fl s Ar string 28.Op Ar 29.Nm rmd160 30.Op Fl pqrtx 31.Op Fl c Ar string 32.Op Fl s Ar string 33.Op Ar 34.Sh DESCRIPTION 35The | 29.Nm sha512 30.Op Fl pqrtx 31.Op Fl c Ar string 32.Op Fl s Ar string 33.Op Ar 34.Nm rmd160 35.Op Fl pqrtx 36.Op Fl c Ar string 37.Op Fl s Ar string 38.Op Ar 39.Sh DESCRIPTION 40The |
36.Nm md5 , sha1 , sha256 , sha512 | 41.Nm md5 , sha1 , sha256 , sha384 , sha512 |
37and 38.Nm rmd160 39utilities take as input a message of arbitrary length and produce as 40output a 41.Dq fingerprint 42or 43.Dq message digest 44of the input. 45It is conjectured that it is computationally infeasible to 46produce two messages having the same message digest, or to produce any 47message having a given prespecified target message digest. 48The | 42and 43.Nm rmd160 44utilities take as input a message of arbitrary length and produce as 45output a 46.Dq fingerprint 47or 48.Dq message digest 49of the input. 50It is conjectured that it is computationally infeasible to 51produce two messages having the same message digest, or to produce any 52message having a given prespecified target message digest. 53The |
49.Tn MD5 , SHA-1 , SHA-256 , SHA-512 | 54.Tn MD5 , SHA-1 , SHA-256 , SHA-384 , SHA-512 |
50and 51.Tn RIPEMD-160 52algorithms are intended for digital signature applications, where a 53large file must be 54.Dq compressed 55in a secure manner before being encrypted with a private 56(secret) 57key under a public-key cryptosystem such as --- 60 unchanged lines hidden (view full) --- 118.Fl c 119option. 120.Sh SEE ALSO 121.Xr cksum 1 , 122.Xr md5 3 , 123.Xr ripemd 3 , 124.Xr sha 3 , 125.Xr sha256 3 , | 55and 56.Tn RIPEMD-160 57algorithms are intended for digital signature applications, where a 58large file must be 59.Dq compressed 60in a secure manner before being encrypted with a private 61(secret) 62key under a public-key cryptosystem such as --- 60 unchanged lines hidden (view full) --- 123.Fl c 124option. 125.Sh SEE ALSO 126.Xr cksum 1 , 127.Xr md5 3 , 128.Xr ripemd 3 , 129.Xr sha 3 , 130.Xr sha256 3 , |
131.Xr sha384 3 , |
|
126.Xr sha512 3 127.Rs 128.%A R. Rivest 129.%T The MD5 Message-Digest Algorithm 130.%O RFC1321 131.Re 132.Rs 133.%A J. Burrows --- 24 unchanged lines hidden --- | 132.Xr sha512 3 133.Rs 134.%A R. Rivest 135.%T The MD5 Message-Digest Algorithm 136.%O RFC1321 137.Re 138.Rs 139.%A J. Burrows --- 24 unchanged lines hidden --- |