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
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
|
/*
* Copyright (C) 2011 Google Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// A straightforward SHA-1 implementation based on RFC 3174.
// http://www.ietf.org/rfc/rfc3174.txt
// The names of functions and variables (such as "a", "b", and "f") follow notations in RFC 3174.
#include "config.h"
#include "SHA1.h"
#include "Assertions.h"
#ifndef NDEBUG
#include "StringExtras.h"
#include "text/CString.h"
#endif
namespace WTF {
#ifdef NDEBUG
static inline void testSHA1() { }
#else
static bool isTestSHA1Done;
static void expectSHA1(CString input, int repeat, CString expected)
{
SHA1 sha1;
for (int i = 0; i < repeat; ++i)
sha1.addBytes(reinterpret_cast<const uint8_t*>(input.data()), input.length());
Vector<uint8_t, 20> digest;
sha1.computeHash(digest);
char* buffer = 0;
CString actual = CString::newUninitialized(40, buffer);
for (size_t i = 0; i < 20; ++i) {
snprintf(buffer, 3, "%02X", digest.at(i));
buffer += 2;
}
ASSERT_WITH_MESSAGE(actual == expected, "input: %s, repeat: %d, actual: %s, expected: %s", input.data(), repeat, actual.data(), expected.data());
}
static void testSHA1()
{
if (isTestSHA1Done)
return;
isTestSHA1Done = true;
// Examples taken from sample code in RFC 3174.
expectSHA1("abc", 1, "A9993E364706816ABA3E25717850C26C9CD0D89D");
expectSHA1("abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 1, "84983E441C3BD26EBAAE4AA1F95129E5E54670F1");
expectSHA1("a", 1000000, "34AA973CD4C4DAA4F61EEB2BDBAD27316534016F");
expectSHA1("0123456701234567012345670123456701234567012345670123456701234567", 10, "DEA356A2CDDD90C7A7ECEDC5EBB563934F460452");
}
#endif
static inline uint32_t f(int t, uint32_t b, uint32_t c, uint32_t d)
{
ASSERT(t >= 0 && t < 80);
if (t < 20)
return (b & c) | ((~b) & d);
if (t < 40)
return b ^ c ^ d;
if (t < 60)
return (b & c) | (b & d) | (c & d);
return b ^ c ^ d;
}
static inline uint32_t k(int t)
{
ASSERT(t >= 0 && t < 80);
if (t < 20)
return 0x5a827999;
if (t < 40)
return 0x6ed9eba1;
if (t < 60)
return 0x8f1bbcdc;
return 0xca62c1d6;
}
static inline uint32_t rotateLeft(int n, uint32_t x)
{
ASSERT(n >= 0 && n < 32);
return (x << n) | (x >> (32 - n));
}
SHA1::SHA1()
{
// FIXME: Move unit tests somewhere outside the constructor. See bug 55853.
testSHA1();
reset();
}
void SHA1::addBytes(const uint8_t* input, size_t length)
{
while (length--) {
ASSERT(m_cursor < 64);
m_buffer[m_cursor++] = *input++;
++m_totalBytes;
if (m_cursor == 64)
processBlock();
}
}
void SHA1::computeHash(Vector<uint8_t, 20>& digest)
{
finalize();
digest.clear();
digest.resize(20);
for (size_t i = 0; i < 5; ++i) {
// Treat hashValue as a big-endian value.
uint32_t hashValue = m_hash[i];
for (int j = 0; j < 4; ++j) {
digest[4 * i + (3 - j)] = hashValue & 0xFF;
hashValue >>= 8;
}
}
reset();
}
void SHA1::finalize()
{
ASSERT(m_cursor < 64);
m_buffer[m_cursor++] = 0x80;
if (m_cursor > 56) {
// Pad out to next block.
while (m_cursor < 64)
m_buffer[m_cursor++] = 0x00;
processBlock();
}
for (size_t i = m_cursor; i < 56; ++i)
m_buffer[i] = 0x00;
// Write the length as a big-endian 64-bit value.
uint64_t bits = m_totalBytes * 8;
for (int i = 0; i < 8; ++i) {
m_buffer[56 + (7 - i)] = bits & 0xFF;
bits >>= 8;
}
m_cursor = 64;
processBlock();
}
void SHA1::processBlock()
{
ASSERT(m_cursor == 64);
uint32_t w[80] = { 0 };
for (int t = 0; t < 16; ++t)
w[t] = (m_buffer[t * 4] << 24) | (m_buffer[t * 4 + 1] << 16) | (m_buffer[t * 4 + 2] << 8) | m_buffer[t * 4 + 3];
for (int t = 16; t < 80; ++t)
w[t] = rotateLeft(1, w[t - 3] ^ w[t - 8] ^ w[t - 14] ^ w[t - 16]);
uint32_t a = m_hash[0];
uint32_t b = m_hash[1];
uint32_t c = m_hash[2];
uint32_t d = m_hash[3];
uint32_t e = m_hash[4];
for (int t = 0; t < 80; ++t) {
uint32_t temp = rotateLeft(5, a) + f(t, b, c, d) + e + w[t] + k(t);
e = d;
d = c;
c = rotateLeft(30, b);
b = a;
a = temp;
}
m_hash[0] += a;
m_hash[1] += b;
m_hash[2] += c;
m_hash[3] += d;
m_hash[4] += e;
m_cursor = 0;
}
void SHA1::reset()
{
m_cursor = 0;
m_totalBytes = 0;
m_hash[0] = 0x67452301;
m_hash[1] = 0xefcdab89;
m_hash[2] = 0x98badcfe;
m_hash[3] = 0x10325476;
m_hash[4] = 0xc3d2e1f0;
// Clear the buffer after use in case it's sensitive.
memset(m_buffer, 0, sizeof(m_buffer));
}
} // namespace WTF
|
