3
|
1 /* LibTomCrypt, modular cryptographic library -- Tom St Denis |
|
2 * |
|
3 * LibTomCrypt is a library that provides various cryptographic |
|
4 * algorithms in a highly modular and flexible manner. |
|
5 * |
|
6 * The library is free for all purposes without any express |
|
7 * guarantee it works. |
|
8 * |
|
9 * Tom St Denis, [email protected], http://libtomcrypt.org |
|
10 */ |
|
11 /* Submited by Dobes Vandermeer ([email protected]) */ |
|
12 |
|
13 #include "mycrypt.h" |
|
14 |
|
15 /* |
|
16 (1) append zeros to the end of K to create a B byte string |
|
17 (e.g., if K is of length 20 bytes and B=64, then K will be |
|
18 appended with 44 zero bytes 0x00) |
|
19 (2) XOR (bitwise exclusive-OR) the B byte string computed in step |
|
20 (1) with ipad (ipad = the byte 0x36 repeated B times) |
|
21 (3) append the stream of data 'text' to the B byte string resulting |
|
22 from step (2) |
|
23 (4) apply H to the stream generated in step (3) |
|
24 (5) XOR (bitwise exclusive-OR) the B byte string computed in |
|
25 step (1) with opad (opad = the byte 0x5C repeated B times.) |
|
26 (6) append the H result from step (4) to the B byte string |
|
27 resulting from step (5) |
|
28 (7) apply H to the stream generated in step (6) and output |
|
29 the result |
|
30 */ |
|
31 |
|
32 #ifdef HMAC |
|
33 |
|
34 #define HMAC_BLOCKSIZE hash_descriptor[hash].blocksize |
|
35 |
|
36 int hmac_process(hmac_state *hmac, const unsigned char *buf, unsigned long len) |
|
37 { |
|
38 int err; |
|
39 _ARGCHK(hmac != NULL); |
|
40 _ARGCHK(buf != NULL); |
|
41 if ((err = hash_is_valid(hmac->hash)) != CRYPT_OK) { |
|
42 return err; |
|
43 } |
|
44 return hash_descriptor[hmac->hash].process(&hmac->md, buf, len); |
|
45 } |
|
46 |
|
47 #endif |
|
48 |