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
|
/*
* Copyright (c) 2010 Remko Tronçon
* Licensed under the GNU General Public License v3.
* See Documentation/Licenses/GPLv3.txt for more information.
*/
#include <Swiften/StringCodecs/HMACSHA1.h>
#include <cassert>
#include <Swiften/StringCodecs/SHA1.h>
#include <Swiften/Base/Algorithm.h>
using namespace Swift;
namespace {
static const unsigned int B = 64;
template<typename SourceType>
ByteArray getHMACSHA1(const SourceType& key, const ByteArray& data) {
assert(key.size() <= B);
// Create the padded key
SourceType paddedKey(key);
paddedKey.resize(B, 0x0);
// Create the first value
SourceType x(paddedKey);
for (unsigned int i = 0; i < x.size(); ++i) {
x[i] ^= 0x36;
}
append(x, data);
// Create the second value
SourceType y(paddedKey);
for (unsigned int i = 0; i < y.size(); ++i) {
y[i] ^= 0x5c;
}
append(y, SHA1::getHash(x));
return SHA1::getHash(y);
}
}
namespace Swift {
ByteArray HMACSHA1::getResult(const SafeByteArray& key, const ByteArray& data) {
return getHMACSHA1(key, data);
}
ByteArray HMACSHA1::getResult(const ByteArray& key, const ByteArray& data) {
return getHMACSHA1(key, data);
}
#if 0
// A tweaked version of HMACSHA1 that is more than twice as fast as the one above.
// After this, more than 80% is spent in SHA1.
// Optimizations:
// - Avoids using ByteArray/std::vector
// - Uses openssl's SHA1, which is slightly faster
// - Does 'xor' on word basis
// - Passes return value as a parameter
#include <openssl/sha.h>
void HMACSHA1::getResult(const ByteArray& key, const ByteArray& data, ByteArray& result) {
// Create first value
size_t xSize = B + data.size();
unsigned char* x = (unsigned char*) malloc(xSize * sizeof(unsigned char));
memset(x, 0, B);
memcpy(x, key.getData(), key.size());
for (unsigned int i = 0; i < (B>>32); ++i) {
x[i<<32] ^= 0x36363636;
}
memcpy(x + B, data.getData(), data.size());
// Create the second value
unsigned char y[B + 20];
memset(y, 0, B);
memcpy(y, key.getData(), key.size());
for (unsigned int i = 0; i < (B>>32); ++i) {
y[i<<32] ^= 0x5c5c5c5c;
}
::SHA1(x, xSize, y + B);
free(x);
::SHA1(y, B + 20, (unsigned char*) result.getData());
}
#endif
}
|
Swift