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
|
/*
* InspIRCd -- Internet Relay Chat Daemon
*
* Copyright (C) 2010 Daniel De Graaf <danieldg@inspircd.org>
*
* This file is part of InspIRCd. InspIRCd is free software: you can
* redistribute it and/or modify it under the terms of the GNU General Public
* License as published by the Free Software Foundation, version 2.
*
* This program 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 General Public License for more
* details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef HASH_H
#define HASH_H
#include "modules.h"
class HashProvider : public DataProvider
{
public:
const unsigned int out_size;
const unsigned int block_size;
HashProvider(Module* mod, const std::string& Name, int osiz, int bsiz)
: DataProvider(mod, Name), out_size(osiz), block_size(bsiz) {}
virtual std::string sum(const std::string& data) = 0;
inline std::string hexsum(const std::string& data)
{
return BinToHex(sum(data));
}
inline std::string b64sum(const std::string& data)
{
return BinToBase64(sum(data), NULL, 0);
}
/** HMAC algorithm, RFC 2104 */
std::string hmac(const std::string& key, const std::string& msg)
{
std::string hmac1, hmac2;
std::string kbuf = key.length() > block_size ? sum(key) : key;
kbuf.resize(block_size);
for (size_t n = 0; n < block_size; n++)
{
hmac1.push_back(static_cast<char>(kbuf[n] ^ 0x5C));
hmac2.push_back(static_cast<char>(kbuf[n] ^ 0x36));
}
hmac2.append(msg);
hmac1.append(sum(hmac2));
return sum(hmac1);
}
};
#endif
|
