2 * Copyright (C) 2011 Google Inc. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are
8 * * Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * * Redistributions in binary form must reproduce the above
11 * copyright notice, this list of conditions and the following disclaimer
12 * in the documentation and/or other materials provided with the
14 * * Neither the name of Google Inc. nor the names of its
15 * contributors may be used to endorse or promote products derived from
16 * this software without specific prior written permission.
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 // A straightforward SHA-1 implementation based on RFC 3174.
32 // http://www.ietf.org/rfc/rfc3174.txt
33 // The names of functions and variables (such as "a", "b", and "f") follow notations in RFC 3174.
38 #include "wtf/Assertions.h"
42 static inline uint32_t f(int t, uint32_t b, uint32_t c, uint32_t d)
44 ASSERT(t >= 0 && t < 80);
46 return (b & c) | ((~b) & d);
50 return (b & c) | (b & d) | (c & d);
54 static inline uint32_t k(int t)
56 ASSERT(t >= 0 && t < 80);
66 static inline uint32_t rotateLeft(int n, uint32_t x)
68 ASSERT(n >= 0 && n < 32);
69 return (x << n) | (x >> (32 - n));
77 void SHA1::addBytes(const uint8_t* input, size_t length)
80 ASSERT(m_cursor < 64);
81 m_buffer[m_cursor++] = *input++;
88 void SHA1::computeHash(Vector<uint8_t, 20>& digest)
94 for (size_t i = 0; i < 5; ++i) {
95 // Treat hashValue as a big-endian value.
96 uint32_t hashValue = m_hash[i];
97 for (int j = 0; j < 4; ++j) {
98 digest[4 * i + (3 - j)] = hashValue & 0xFF;
106 void SHA1::finalize()
108 ASSERT(m_cursor < 64);
109 m_buffer[m_cursor++] = 0x80;
111 // Pad out to next block.
112 while (m_cursor < 64)
113 m_buffer[m_cursor++] = 0x00;
117 for (size_t i = m_cursor; i < 56; ++i)
120 // Write the length as a big-endian 64-bit value.
121 uint64_t bits = m_totalBytes * 8;
122 for (int i = 0; i < 8; ++i) {
123 m_buffer[56 + (7 - i)] = bits & 0xFF;
130 void SHA1::processBlock()
132 ASSERT(m_cursor == 64);
134 uint32_t w[80] = { 0 };
135 for (int t = 0; t < 16; ++t)
136 w[t] = (m_buffer[t * 4] << 24) | (m_buffer[t * 4 + 1] << 16) | (m_buffer[t * 4 + 2] << 8) | m_buffer[t * 4 + 3];
137 for (int t = 16; t < 80; ++t)
138 w[t] = rotateLeft(1, w[t - 3] ^ w[t - 8] ^ w[t - 14] ^ w[t - 16]);
140 uint32_t a = m_hash[0];
141 uint32_t b = m_hash[1];
142 uint32_t c = m_hash[2];
143 uint32_t d = m_hash[3];
144 uint32_t e = m_hash[4];
146 for (int t = 0; t < 80; ++t) {
147 uint32_t temp = rotateLeft(5, a) + f(t, b, c, d) + e + w[t] + k(t);
150 c = rotateLeft(30, b);
168 m_hash[0] = 0x67452301;
169 m_hash[1] = 0xefcdab89;
170 m_hash[2] = 0x98badcfe;
171 m_hash[3] = 0x10325476;
172 m_hash[4] = 0xc3d2e1f0;
174 // Clear the buffer after use in case it's sensitive.
175 memset(m_buffer, 0, sizeof(m_buffer));