| 1 |
/* Copyright (C) 1995-1998 Eric Young ([email protected]) |
| 2 |
* All rights reserved. |
| 3 |
* |
| 4 |
* This package is an SSL implementation written |
| 5 |
* by Eric Young ([email protected]). |
| 6 |
* The implementation was written so as to conform with Netscapes SSL. |
| 7 |
* |
| 8 |
* This library is free for commercial and non-commercial use as long as |
| 9 |
* the following conditions are aheared to. The following conditions |
| 10 |
* apply to all code found in this distribution, be it the RC4, RSA, |
| 11 |
* lhash, DES, etc., code; not just the SSL code. The SSL documentation |
| 12 |
* included with this distribution is covered by the same copyright terms |
| 13 |
* except that the holder is Tim Hudson ([email protected]). |
| 14 |
* |
| 15 |
* Copyright remains Eric Young's, and as such any Copyright notices in |
| 16 |
* the code are not to be removed. |
| 17 |
* If this package is used in a product, Eric Young should be given attribution |
| 18 |
* as the author of the parts of the library used. |
| 19 |
* This can be in the form of a textual message at program startup or |
| 20 |
* in documentation (online or textual) provided with the package. |
| 21 |
* |
| 22 |
* Redistribution and use in source and binary forms, with or without |
| 23 |
* modification, are permitted provided that the following conditions |
| 24 |
* are met: |
| 25 |
* 1. Redistributions of source code must retain the copyright |
| 26 |
* notice, this list of conditions and the following disclaimer. |
| 27 |
* 2. Redistributions in binary form must reproduce the above copyright |
| 28 |
* notice, this list of conditions and the following disclaimer in the |
| 29 |
* documentation and/or other materials provided with the distribution. |
| 30 |
* 3. All advertising materials mentioning features or use of this software |
| 31 |
* must display the following acknowledgement: |
| 32 |
* "This product includes cryptographic software written by |
| 33 |
* Eric Young ([email protected])" |
| 34 |
* The word 'cryptographic' can be left out if the rouines from the library |
| 35 |
* being used are not cryptographic related :-). |
| 36 |
* 4. If you include any Windows specific code (or a derivative thereof) from |
| 37 |
* the apps directory (application code) you must include an acknowledgement: |
| 38 |
* "This product includes software written by Tim Hudson ([email protected])" |
| 39 |
* |
| 40 |
* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND |
| 41 |
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 42 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 43 |
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE |
| 44 |
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 45 |
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 46 |
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 47 |
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 48 |
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 49 |
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 50 |
* SUCH DAMAGE. |
| 51 |
* |
| 52 |
* The licence and distribution terms for any publically available version or |
| 53 |
* derivative of this code cannot be changed. i.e. this code cannot simply be |
| 54 |
* copied and put under another distribution licence |
| 55 |
* [including the GNU Public Licence.] */ |
| 56 |
|
| 57 |
#include <openssl/hmac.h> |
| 58 |
|
| 59 |
#include <assert.h> |
| 60 |
#include <string.h> |
| 61 |
|
| 62 |
#include <openssl/digest.h> |
| 63 |
#include <openssl/mem.h> |
| 64 |
|
| 65 |
|
| 66 |
uint8_t *HMAC(const EVP_MD *evp_md, const void *key, size_t key_len, |
| 67 |
const uint8_t *data, size_t data_len, uint8_t *out, |
| 68 |
unsigned int *out_len) { |
| 69 |
HMAC_CTX ctx; |
| 70 |
static uint8_t static_out_buffer[EVP_MAX_MD_SIZE]; |
| 71 |
|
| 72 |
/* OpenSSL has traditionally supported using a static buffer if |out| is |
| 73 |
* NULL. We maintain that but don't document it. This behaviour should be |
| 74 |
* considered to be deprecated. */ |
| 75 |
if (out == NULL) { |
| 76 |
out = static_out_buffer; |
| 77 |
} |
| 78 |
|
| 79 |
HMAC_CTX_init(&ctx); |
| 80 |
if (!HMAC_Init_ex(&ctx, key, key_len, evp_md, NULL) || |
| 81 |
!HMAC_Update(&ctx, data, data_len) || |
| 82 |
!HMAC_Final(&ctx, out, out_len)) { |
| 83 |
out = NULL; |
| 84 |
} |
| 85 |
|
| 86 |
HMAC_CTX_cleanup(&ctx); |
| 87 |
return out; |
| 88 |
} |
| 89 |
|
| 90 |
void HMAC_CTX_init(HMAC_CTX *ctx) { |
| 91 |
ctx->md = NULL; |
| 92 |
EVP_MD_CTX_init(&ctx->i_ctx); |
| 93 |
EVP_MD_CTX_init(&ctx->o_ctx); |
| 94 |
EVP_MD_CTX_init(&ctx->md_ctx); |
| 95 |
} |
| 96 |
|
| 97 |
void HMAC_CTX_cleanup(HMAC_CTX *ctx) { |
| 98 |
EVP_MD_CTX_cleanup(&ctx->i_ctx); |
| 99 |
EVP_MD_CTX_cleanup(&ctx->o_ctx); |
| 100 |
EVP_MD_CTX_cleanup(&ctx->md_ctx); |
| 101 |
OPENSSL_cleanse(ctx, sizeof(HMAC_CTX)); |
| 102 |
} |
| 103 |
|
| 104 |
int HMAC_Init_ex(HMAC_CTX *ctx, const void *key, size_t key_len, |
| 105 |
const EVP_MD *md, ENGINE *impl) { |
| 106 |
if (md == NULL) { |
| 107 |
md = ctx->md; |
| 108 |
} |
| 109 |
|
| 110 |
/* If either |key| is non-NULL or |md| has changed, initialize with a new key |
| 111 |
* rather than rewinding the previous one. |
| 112 |
* |
| 113 |
* TODO(davidben,eroman): Passing the previous |md| with a NULL |key| is |
| 114 |
* ambiguous between using the empty key and reusing the previous key. There |
| 115 |
* exist callers which intend the latter, but the former is an awkward edge |
| 116 |
* case. Fix to API to avoid this. */ |
| 117 |
if (md != ctx->md || key != NULL) { |
| 118 |
size_t i; |
| 119 |
uint8_t pad[EVP_MAX_MD_BLOCK_SIZE]; |
| 120 |
uint8_t key_block[EVP_MAX_MD_BLOCK_SIZE]; |
| 121 |
unsigned key_block_len; |
| 122 |
|
| 123 |
size_t block_size = EVP_MD_block_size(md); |
| 124 |
assert(block_size <= sizeof(key_block)); |
| 125 |
if (block_size < key_len) { |
| 126 |
/* Long keys are hashed. */ |
| 127 |
if (!EVP_DigestInit_ex(&ctx->md_ctx, md, impl) || |
| 128 |
!EVP_DigestUpdate(&ctx->md_ctx, key, key_len) || |
| 129 |
!EVP_DigestFinal_ex(&ctx->md_ctx, key_block, &key_block_len)) { |
| 130 |
return 0; |
| 131 |
} |
| 132 |
} else { |
| 133 |
assert(key_len <= sizeof(key_block)); |
| 134 |
memcpy(key_block, key, key_len); |
| 135 |
key_block_len = (unsigned)key_len; |
| 136 |
} |
| 137 |
/* Keys are then padded with zeros. */ |
| 138 |
if (key_block_len != EVP_MAX_MD_BLOCK_SIZE) { |
| 139 |
memset(&key_block[key_block_len], 0, sizeof(key_block) - key_block_len); |
| 140 |
} |
| 141 |
|
| 142 |
for (i = 0; i < EVP_MAX_MD_BLOCK_SIZE; i++) { |
| 143 |
pad[i] = 0x36 ^ key_block[i]; |
| 144 |
} |
| 145 |
if (!EVP_DigestInit_ex(&ctx->i_ctx, md, impl) || |
| 146 |
!EVP_DigestUpdate(&ctx->i_ctx, pad, EVP_MD_block_size(md))) { |
| 147 |
return 0; |
| 148 |
} |
| 149 |
|
| 150 |
for (i = 0; i < EVP_MAX_MD_BLOCK_SIZE; i++) { |
| 151 |
pad[i] = 0x5c ^ key_block[i]; |
| 152 |
} |
| 153 |
if (!EVP_DigestInit_ex(&ctx->o_ctx, md, impl) || |
| 154 |
!EVP_DigestUpdate(&ctx->o_ctx, pad, EVP_MD_block_size(md))) { |
| 155 |
return 0; |
| 156 |
} |
| 157 |
|
| 158 |
ctx->md = md; |
| 159 |
} |
| 160 |
|
| 161 |
if (!EVP_MD_CTX_copy_ex(&ctx->md_ctx, &ctx->i_ctx)) { |
| 162 |
return 0; |
| 163 |
} |
| 164 |
|
| 165 |
return 1; |
| 166 |
} |
| 167 |
|
| 168 |
int HMAC_Update(HMAC_CTX *ctx, const uint8_t *data, size_t data_len) { |
| 169 |
return EVP_DigestUpdate(&ctx->md_ctx, data, data_len); |
| 170 |
} |
| 171 |
|
| 172 |
int HMAC_Final(HMAC_CTX *ctx, uint8_t *out, unsigned int *out_len) { |
| 173 |
unsigned int i; |
| 174 |
uint8_t buf[EVP_MAX_MD_SIZE]; |
| 175 |
|
| 176 |
/* TODO(davidben): The only thing that can officially fail here is |
| 177 |
* |EVP_MD_CTX_copy_ex|, but even that should be impossible in this case. */ |
| 178 |
if (!EVP_DigestFinal_ex(&ctx->md_ctx, buf, &i) || |
| 179 |
!EVP_MD_CTX_copy_ex(&ctx->md_ctx, &ctx->o_ctx) || |
| 180 |
!EVP_DigestUpdate(&ctx->md_ctx, buf, i) || |
| 181 |
!EVP_DigestFinal_ex(&ctx->md_ctx, out, out_len)) { |
| 182 |
*out_len = 0; |
| 183 |
return 0; |
| 184 |
} |
| 185 |
|
| 186 |
return 1; |
| 187 |
} |
| 188 |
|
| 189 |
size_t HMAC_size(const HMAC_CTX *ctx) { |
| 190 |
return EVP_MD_size(ctx->md); |
| 191 |
} |
| 192 |
|
| 193 |
int HMAC_CTX_copy_ex(HMAC_CTX *dest, const HMAC_CTX *src) { |
| 194 |
if (!EVP_MD_CTX_copy_ex(&dest->i_ctx, &src->i_ctx) || |
| 195 |
!EVP_MD_CTX_copy_ex(&dest->o_ctx, &src->o_ctx) || |
| 196 |
!EVP_MD_CTX_copy_ex(&dest->md_ctx, &src->md_ctx)) { |
| 197 |
return 0; |
| 198 |
} |
| 199 |
|
| 200 |
dest->md = src->md; |
| 201 |
return 1; |
| 202 |
} |
| 203 |
|
| 204 |
int HMAC_Init(HMAC_CTX *ctx, const void *key, int key_len, const EVP_MD *md) { |
| 205 |
if (key && md) { |
| 206 |
HMAC_CTX_init(ctx); |
| 207 |
} |
| 208 |
return HMAC_Init_ex(ctx, key, key_len, md, NULL); |
| 209 |
} |
| 210 |
|
| 211 |
int HMAC_CTX_copy(HMAC_CTX *dest, const HMAC_CTX *src) { |
| 212 |
HMAC_CTX_init(dest); |
| 213 |
return HMAC_CTX_copy_ex(dest, src); |
| 214 |
} |