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
|
/*
* Copyright (c) 1999, 2000, 2002 Virtual Unlimited B.V.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
/*!\file hmac.c
* \brief HMAC algorithm.
*
* \see RFC2104 HMAC: Keyed-Hashing for Message Authentication.
* H. Krawczyk, M. Bellare, R. Canetti.
*
* \author Bob Deblier <bob.deblier@pandore.be>
* \ingroup HMAC_m
*/
#include "system.h"
#include "hmac.h"
#include "mp.h"
#include "endianness.h"
#include "debug.h"
/*!\addtogroup HMAC_m
* \{
*/
#define HMAC_IPAD 0x36
#define HMAC_OPAD 0x5c
int hmacSetup(byte* kxi, byte* kxo, const hashFunction* hash, hashFunctionParam* param, const byte* key, size_t keybits)
{
register int i;
size_t keybytes = keybits >> 3;
/* if the key is too large, hash it first */
if (keybytes > hash->blocksize)
{
/* if the hash digest is too large, this doesn't help; this is really a sanity check */
if (hash->digestsize > hash->blocksize)
return -1;
if (hash->reset(param))
return -1;
if (hash->update(param, key, keybytes))
return -1;
if (hash->digest(param, kxi))
return -1;
memcpy(kxo, kxi, keybytes = hash->digestsize);
}
else if (keybytes > 0)
{
memcpy(kxi, key, keybytes);
memcpy(kxo, key, keybytes);
}
else
return -1;
for (i = 0; i < keybytes; i++)
{
kxi[i] ^= HMAC_IPAD;
kxo[i] ^= HMAC_OPAD;
}
for (i = keybytes; i < hash->blocksize; i++)
{
kxi[i] = HMAC_IPAD;
kxo[i] = HMAC_OPAD;
}
return hmacReset(kxi, hash, param);
}
int hmacReset(const byte* kxi, const hashFunction* hash, hashFunctionParam* param)
{
if (hash->reset(param))
return -1;
if (hash->update(param, kxi, hash->blocksize))
return -1;
return 0;
}
int hmacUpdate(const hashFunction* hash, hashFunctionParam* param, const byte* data, size_t size)
{
return hash->update(param, data, size);
}
int hmacDigest(const byte* kxo, const hashFunction* hash, hashFunctionParam* param, byte* data)
{
if (hash->digest(param, data))
return -1;
if (hash->update(param, kxo, hash->blocksize))
return -1;
if (hash->update(param, data, hash->digestsize))
return -1;
if (hash->digest(param, data))
return -1;
return 0;
}
/*!\}
*/
|
