summaryrefslogtreecommitdiffstats
blob: 8b02d8857b0d12fe1746b96ee38c72b443222347 (plain)
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
/*
 * Copyright (c) 2010 Remko Tronçon
 * Licensed under the GNU General Public License v3.
 * See Documentation/Licenses/GPLv3.txt for more information.
 */

#pragma once

#include <Swiften/Base/SafeByteArray.h>
#include <Swiften/Base/ByteArray.h>
#include <Swiften/Base/Algorithm.h>
#include <cassert>

namespace Swift {
	namespace HMAC_Detail {
		template<typename KeyType> struct KeyWrapper;
		template<> struct KeyWrapper<ByteArray> {
			ByteArray wrap(const ByteArray& hash) const {
				return hash;
			}
		};
		template<> struct KeyWrapper<SafeByteArray> {
			SafeByteArray wrap(const ByteArray& hash) const {
				return createSafeByteArray(hash);
			}
		};

		template<typename Hash, typename KeyType, int BlockSize>
		static ByteArray getHMAC(const KeyType& key, const ByteArray& data) {
			Hash hash;

			// Create the padded key
			KeyType paddedKey(key.size() <= BlockSize ? key : KeyWrapper<KeyType>().wrap(hash(key)));
			paddedKey.resize(BlockSize, 0x0);

			// Create the first value
			KeyType x(paddedKey);
			for (unsigned int i = 0; i < x.size(); ++i) {
				x[i] ^= 0x36;
			}
			append(x, data);

			// Create the second value
			KeyType y(paddedKey);
			for (unsigned int i = 0; i < y.size(); ++i) {
				y[i] ^= 0x5c;
			}
			append(y, hash(x));

			return hash(y);
		}
	}

	template<typename Hash, int BlockSize>
	class HMAC {
		private:

		public:
			ByteArray operator()(const ByteArray& key, const ByteArray& data) const {
				return HMAC_Detail::getHMAC<Hash,ByteArray,BlockSize>(key, data);
			}

			ByteArray operator()(const SafeByteArray& key, const ByteArray& data) const {
				return HMAC_Detail::getHMAC<Hash,SafeByteArray,BlockSize>(key, data);
			}
	};
}