1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
|
/*
* hmac_sha1.c
*
* Version 1.0.0
*
* Written by Aaron D. Gifford <me@aarongifford.com>
*
* Copyright 1998, 2000 Aaron D. Gifford. All rights reserved.
*
* 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 copyright holder nor the names of contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) 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 AUTHOR(S) 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.
*/
/*
* The HMAC-SHA1 has is defined as:
*
* HMAC = SHA1(K XOR opad, SHA1(K XOR ipad, message))
*
* "opad" is 64 bytes filled with 0x5c
* "ipad" is 64 bytes filled with 0x36
* "K" is the key material
*
* If the key material "K" is longer than 64 bytes, then the key material
* will first be digested (K = SHA1(K)) resulting in a 20-byte hash.
* If the key material is shorter than 64 bytes, it is padded with zero
* bytes.
*
* This code precomputes "K XOR ipad" and "K XOR opad" since that just makes
* sense.
*
* This code was heavily influenced by Eric A. Young's in how the interface
* was designed and how this file is formatted.
*/
#ifndef __HMAC_SHA1_H__
#define __HMAC_SHA1_H__
#include <string.h>
#include "hmac_sha1.h"
#ifdef __cplusplus
extern "C" {
#endif
/* Filler bytes: */
#define IPAD_BYTE 0x36
#define OPAD_BYTE 0x5c
#define ZERO_BYTE 0x00
void HMAC_SHA1_Init(HMAC_SHA1_CTX *ctx) {
memset(&(ctx->key[0]), ZERO_BYTE, HMAC_SHA1_BLOCK_LENGTH);
memset(&(ctx->ipad[0]), IPAD_BYTE, HMAC_SHA1_BLOCK_LENGTH);
memset(&(ctx->opad[0]), OPAD_BYTE, HMAC_SHA1_BLOCK_LENGTH);
ctx->keylen = 0;
ctx->hashkey = 0;
}
void HMAC_SHA1_UpdateKey(HMAC_SHA1_CTX *ctx, unsigned char *key, unsigned int keylen) {
/* Do we have anything to work with? If not, return right away. */
if (keylen < 1)
return;
/*
* Is the total key length (current data and any previous data)
* longer than the hash block length?
*/
if (ctx->hashkey !=0 || (keylen + ctx->keylen) > HMAC_SHA1_BLOCK_LENGTH) {
/*
* Looks like the key data exceeds the hash block length,
* so that means we use a hash of the key as the key data
* instead.
*/
if (ctx->hashkey == 0) {
/*
* Ah, we haven't started hashing the key
* data yet, so we must init. the hash
* monster to begin feeding it.
*/
/* Set the hash key flag to true (non-zero) */
ctx->hashkey = 1;
/* Init. the hash beastie... */
SHA1_Init(&ctx->shactx);
/* If there's any previous key data, use it */
if (ctx->keylen > 0) {
SHA1_Update(&ctx->shactx, &(ctx->key[0]), ctx->keylen);
}
/*
* Reset the key length to the future true
* key length, HMAC_SHA1_DIGEST_LENGTH
*/
ctx->keylen = HMAC_SHA1_DIGEST_LENGTH;
}
/* Now feed the latest key data to the has monster */
SHA1_Update(&ctx->shactx, key, keylen);
} else {
/*
* Key data length hasn't yet exceeded the hash
* block length (HMAC_SHA1_BLOCK_LENGTH), so theres
* no need to hash the key data (yet). Copy it
* into the key buffer.
*/
memcpy(&(ctx->key[ctx->keylen]), key, keylen);
ctx->keylen += keylen;
}
}
void HMAC_SHA1_EndKey(HMAC_SHA1_CTX *ctx) {
unsigned char *ipad, *opad, *key;
unsigned int i;
/* Did we end up hashing the key? */
if (ctx->hashkey) {
memset(&(ctx->key[0]), ZERO_BYTE, HMAC_SHA1_BLOCK_LENGTH);
/* Yes, so finish up and copy the key data */
SHA1_Final(&(ctx->key[0]), &ctx->shactx);
/* ctx->keylen was already set correctly */
}
/* Pad the key if necessary with zero bytes */
if ((i = HMAC_SHA1_BLOCK_LENGTH - ctx->keylen) > 0) {
memset(&(ctx->key[ctx->keylen]), ZERO_BYTE, i);
}
ipad = &(ctx->ipad[0]);
opad = &(ctx->opad[0]);
/* Precompute the respective pads XORed with the key */
key = &(ctx->key[0]);
for (i = 0; i < ctx->keylen; i++, key++) {
/* XOR the key byte with the appropriate pad filler byte */
*ipad++ ^= *key;
*opad++ ^= *key;
}
}
void HMAC_SHA1_StartMessage(HMAC_SHA1_CTX *ctx) {
SHA1_Init(&ctx->shactx);
SHA1_Update(&ctx->shactx, &(ctx->ipad[0]), HMAC_SHA1_BLOCK_LENGTH);
}
void HMAC_SHA1_UpdateMessage(HMAC_SHA1_CTX *ctx, unsigned char *data, unsigned int datalen) {
SHA1_Update(&ctx->shactx, data, datalen);
}
void HMAC_SHA1_EndMessage(unsigned char *out, HMAC_SHA1_CTX *ctx) {
unsigned char buf[HMAC_SHA1_DIGEST_LENGTH];
SHA_CTX *c = &ctx->shactx;
SHA1_Final(&(buf[0]), c);
SHA1_Init(c);
SHA1_Update(c, &(ctx->opad[0]), HMAC_SHA1_BLOCK_LENGTH);
SHA1_Update(c, buf, HMAC_SHA1_DIGEST_LENGTH);
SHA1_Final(out, c);
}
void HMAC_SHA1_Done(HMAC_SHA1_CTX *ctx) {
/* Just to be safe, toast all context data */
SHA1_force_memset(&(ctx->ipad[0]), ZERO_BYTE, HMAC_SHA1_BLOCK_LENGTH);
SHA1_force_memset(&(ctx->opad[0]), ZERO_BYTE, HMAC_SHA1_BLOCK_LENGTH);
SHA1_force_memset(&(ctx->key[0]), ZERO_BYTE, HMAC_SHA1_BLOCK_LENGTH);
SHA1_force_memset(&ctx->keylen, ZERO_BYTE, sizeof(ctx->keylen));
SHA1_force_memset(&ctx->hashkey, ZERO_BYTE, sizeof(ctx->hashkey));
}
#ifdef __cplusplus
}
#endif
#endif
|
