| 1 |
/* |
| 2 |
* Copyright (c) 2006 - 2007 Kungliga Tekniska Högskolan |
| 3 |
* (Royal Institute of Technology, Stockholm, Sweden). |
| 4 |
* All rights reserved. |
| 5 |
* |
| 6 |
* Redistribution and use in source and binary forms, with or without |
| 7 |
* modification, are permitted provided that the following conditions |
| 8 |
* are met: |
| 9 |
* |
| 10 |
* 1. Redistributions of source code must retain the above copyright |
| 11 |
* notice, this list of conditions and the following disclaimer. |
| 12 |
* |
| 13 |
* 2. Redistributions in binary form must reproduce the above copyright |
| 14 |
* notice, this list of conditions and the following disclaimer in the |
| 15 |
* documentation and/or other materials provided with the distribution. |
| 16 |
* |
| 17 |
* 3. Neither the name of the Institute nor the names of its contributors |
| 18 |
* may be used to endorse or promote products derived from this software |
| 19 |
* without specific prior written permission. |
| 20 |
* |
| 21 |
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND |
| 22 |
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 23 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 24 |
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE |
| 25 |
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 26 |
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 27 |
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 28 |
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 29 |
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 30 |
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 31 |
* SUCH DAMAGE. |
| 32 |
*/ |
| 33 |
|
| 34 |
#include <config.h> |
| 35 |
#include <roken.h> |
| 36 |
|
| 37 |
#include <hmac.h> |
| 38 |
|
| 39 |
void |
| 40 |
HMAC_CTX_init(HMAC_CTX *ctx) |
| 41 |
{ |
| 42 |
memset(ctx, 0, sizeof(*ctx)); |
| 43 |
} |
| 44 |
|
| 45 |
void |
| 46 |
HMAC_CTX_cleanup(HMAC_CTX *ctx) |
| 47 |
{ |
| 48 |
if (ctx->buf) { |
| 49 |
memset(ctx->buf, 0, ctx->key_length); |
| 50 |
free(ctx->buf); |
| 51 |
ctx->buf = NULL; |
| 52 |
} |
| 53 |
if (ctx->opad) { |
| 54 |
memset(ctx->opad, 0, EVP_MD_block_size(ctx->md)); |
| 55 |
free(ctx->opad); |
| 56 |
ctx->opad = NULL; |
| 57 |
} |
| 58 |
if (ctx->ipad) { |
| 59 |
memset(ctx->ipad, 0, EVP_MD_block_size(ctx->md)); |
| 60 |
free(ctx->ipad); |
| 61 |
ctx->ipad = NULL; |
| 62 |
} |
| 63 |
if (ctx->ctx) { |
| 64 |
EVP_MD_CTX_destroy(ctx->ctx); |
| 65 |
ctx->ctx = NULL; |
| 66 |
} |
| 67 |
} |
| 68 |
|
| 69 |
size_t |
| 70 |
HMAC_size(const HMAC_CTX *ctx) |
| 71 |
{ |
| 72 |
return EVP_MD_size(ctx->md); |
| 73 |
} |
| 74 |
|
| 75 |
void |
| 76 |
HMAC_Init_ex(HMAC_CTX *ctx, |
| 77 |
const void *key, |
| 78 |
size_t keylen, |
| 79 |
const EVP_MD *md, |
| 80 |
ENGINE *engine) |
| 81 |
{ |
| 82 |
unsigned char *p; |
| 83 |
size_t i; |
| 84 |
|
| 85 |
if (ctx->md != md) { |
| 86 |
ctx->md = md; |
| 87 |
if (ctx->buf) { |
| 88 |
memset(ctx->buf, 0, ctx->key_length); |
| 89 |
free (ctx->buf); |
| 90 |
} |
| 91 |
ctx->key_length = EVP_MD_size(ctx->md); |
| 92 |
ctx->buf = malloc(ctx->key_length); |
| 93 |
} |
| 94 |
#if 0 |
| 95 |
ctx->engine = engine; |
| 96 |
#endif |
| 97 |
|
| 98 |
if (keylen > EVP_MD_block_size(ctx->md)) { |
| 99 |
EVP_Digest(key, keylen, ctx->buf, NULL, ctx->md, engine); |
| 100 |
key = ctx->buf; |
| 101 |
keylen = EVP_MD_size(ctx->md); |
| 102 |
} |
| 103 |
|
| 104 |
if (ctx->opad) { |
| 105 |
memset(ctx->opad, 0, ctx->key_length); |
| 106 |
free(ctx->opad); |
| 107 |
} |
| 108 |
if (ctx->ipad) { |
| 109 |
memset(ctx->ipad, 0, ctx->key_length); |
| 110 |
free(ctx->ipad); |
| 111 |
} |
| 112 |
|
| 113 |
ctx->opad = malloc(EVP_MD_block_size(ctx->md)); |
| 114 |
ctx->ipad = malloc(EVP_MD_block_size(ctx->md)); |
| 115 |
memset(ctx->ipad, 0x36, EVP_MD_block_size(ctx->md)); |
| 116 |
memset(ctx->opad, 0x5c, EVP_MD_block_size(ctx->md)); |
| 117 |
|
| 118 |
for (i = 0, p = ctx->ipad; i < keylen; i++) |
| 119 |
p[i] ^= ((const unsigned char *)key)[i]; |
| 120 |
for (i = 0, p = ctx->opad; i < keylen; i++) |
| 121 |
p[i] ^= ((const unsigned char *)key)[i]; |
| 122 |
|
| 123 |
if (ctx->ctx == NULL) |
| 124 |
ctx->ctx = EVP_MD_CTX_create(); |
| 125 |
|
| 126 |
EVP_DigestInit_ex(ctx->ctx, ctx->md, ctx->engine); |
| 127 |
EVP_DigestUpdate(ctx->ctx, ctx->ipad, EVP_MD_block_size(ctx->md)); |
| 128 |
} |
| 129 |
|
| 130 |
void |
| 131 |
HMAC_Update(HMAC_CTX *ctx, const void *data, size_t len) |
| 132 |
{ |
| 133 |
EVP_DigestUpdate(ctx->ctx, data, len); |
| 134 |
} |
| 135 |
|
| 136 |
void |
| 137 |
HMAC_Final(HMAC_CTX *ctx, void *md, unsigned int *len) |
| 138 |
{ |
| 139 |
EVP_DigestFinal_ex(ctx->ctx, ctx->buf, NULL); |
| 140 |
|
| 141 |
EVP_DigestInit_ex(ctx->ctx, ctx->md, ctx->engine); |
| 142 |
EVP_DigestUpdate(ctx->ctx, ctx->opad, EVP_MD_block_size(ctx->md)); |
| 143 |
EVP_DigestUpdate(ctx->ctx, ctx->buf, ctx->key_length); |
| 144 |
EVP_DigestFinal_ex(ctx->ctx, md, len); |
| 145 |
} |
| 146 |
|
| 147 |
void * |
| 148 |
HMAC(const EVP_MD *md, |
| 149 |
const void *key, size_t key_size, |
| 150 |
const void *data, size_t data_size, |
| 151 |
void *hash, unsigned int *hash_len) |
| 152 |
{ |
| 153 |
HMAC_CTX ctx; |
| 154 |
|
| 155 |
HMAC_CTX_init(&ctx); |
| 156 |
HMAC_Init_ex(&ctx, key, key_size, md, NULL); |
| 157 |
HMAC_Update(&ctx, data, data_size); |
| 158 |
HMAC_Final(&ctx, hash, hash_len); |
| 159 |
HMAC_CTX_cleanup(&ctx); |
| 160 |
return hash; |
| 161 |
} |