2 .\" ----------------------------------------------------------------------------
3 .\" "THE BEER-WARE LICENSE" (Revision 42):
4 .\" <phk@FreeBSD.org> wrote this file. As long as you retain this notice you
5 .\" can do whatever you want with this stuff. If we meet some day, and you think
6 .\" this stuff is worth it, you can buy me a beer in return. Poul-Henning Kamp
7 .\" ----------------------------------------------------------------------------
9 .\" From: Id: mdX.3,v 1.14 1999/02/11 20:31:49 wollman Exp
10 .\" $FreeBSD: src/lib/libmd/sha512.3,v 1.4 2005/11/17 13:00:00 ru Exp $
19 .Nd calculate the FIPS 180-2 ``SHA-384'' message digest
26 .Fn SHA384_Init "SHA384_CTX *context"
28 .Fn SHA384_Update "SHA384_CTX *context" "const u_int8_t *data" "size_t len"
30 .Fn SHA384_Final "u_int8_t digest[48]" "SHA384_CTX *context"
34 functions calculate a 384-bit cryptographic checksum (digest)
35 for any number of input bytes.
36 A cryptographic checksum is a one-way
37 hash function; that is, it is computationally impractical to find
38 the input corresponding to a particular output.
42 of the input-data, which does not disclose the actual input.
49 functions are the core functions.
54 run over the data with
56 and finally extract the result using
65 These functions appeared in
68 The core hash routines were implemented by Colin Percival based on
73 No method is known to exist which finds two files having the same hash value,
74 nor to find a file with a specific hash value.
75 There is on the other hand no guarantee that such a method does not exist.