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
|
/*
* HMAC
* (C) 1999-2007,2014 Jack Lloyd
* 2007 Yves Jerschow
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#include <botan/hmac.h>
namespace Botan {
/*
* Update a HMAC Calculation
*/
void HMAC::add_data(const uint8_t input[], size_t length)
{
m_hash->update(input, length);
}
/*
* Finalize a HMAC Calculation
*/
void HMAC::final_result(uint8_t mac[])
{
m_hash->final(mac);
m_hash->update(m_okey);
m_hash->update(mac, output_length());
m_hash->final(mac);
m_hash->update(m_ikey);
}
/*
* HMAC Key Schedule
*/
void HMAC::key_schedule(const uint8_t key[], size_t length)
{
m_hash->clear();
m_ikey.resize(m_hash->hash_block_size());
m_okey.resize(m_hash->hash_block_size());
const uint8_t ipad = 0x36;
const uint8_t opad = 0x5C;
std::fill(m_ikey.begin(), m_ikey.end(), ipad);
std::fill(m_okey.begin(), m_okey.end(), opad);
if(length > m_hash->hash_block_size())
{
secure_vector<uint8_t> hmac_key = m_hash->process(key, length);
xor_buf(m_ikey, hmac_key, hmac_key.size());
xor_buf(m_okey, hmac_key, hmac_key.size());
}
else
{
xor_buf(m_ikey, key, length);
xor_buf(m_okey, key, length);
}
m_hash->update(m_ikey);
}
/*
* Clear memory of sensitive data
*/
void HMAC::clear()
{
m_hash->clear();
zap(m_ikey);
zap(m_okey);
}
/*
* Return the name of this type
*/
std::string HMAC::name() const
{
return "HMAC(" + m_hash->name() + ")";
}
/*
* Return a clone of this object
*/
MessageAuthenticationCode* HMAC::clone() const
{
return new HMAC(m_hash->clone());
}
/*
* HMAC Constructor
*/
HMAC::HMAC(HashFunction* hash) : m_hash(hash)
{
if(m_hash->hash_block_size() == 0)
throw Invalid_Argument("HMAC cannot be used with " + m_hash->name());
}
}
|
