Line data Source code
1 : /*
2 : * Copyright (c) 1995 - 2001 Kungliga Tekniska Högskolan
3 : * (Royal Institute of Technology, Stockholm, Sweden).
4 : * All rights reserved.
5 : *
6 : * Redistribution and use in source and binary forms, with or without
7 : * modification, are permitted provided that the following conditions
8 : * are met:
9 : *
10 : * 1. Redistributions of source code must retain the above copyright
11 : * notice, this list of conditions and the following disclaimer.
12 : *
13 : * 2. Redistributions in binary form must reproduce the above copyright
14 : * notice, this list of conditions and the following disclaimer in the
15 : * documentation and/or other materials provided with the distribution.
16 : *
17 : * 3. Neither the name of the Institute nor the names of its contributors
18 : * may be used to endorse or promote products derived from this software
19 : * without specific prior written permission.
20 : *
21 : * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22 : * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 : * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 : * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25 : * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 : * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 : * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 : * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 : * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 : * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 : * SUCH DAMAGE.
32 : */
33 :
34 : #include <config.h>
35 : #include <roken.h>
36 :
37 : #include "hash.h"
38 : #include "sha.h"
39 :
40 : #define A m->counter[0]
41 : #define B m->counter[1]
42 : #define C m->counter[2]
43 : #define D m->counter[3]
44 : #define E m->counter[4]
45 : #define X data
46 :
47 : int
48 1404281914 : SHA1_Init (struct sha *m)
49 : {
50 1404281914 : m->sz[0] = 0;
51 1404281914 : m->sz[1] = 0;
52 1404281914 : A = 0x67452301;
53 1404281914 : B = 0xefcdab89;
54 1404281914 : C = 0x98badcfe;
55 1404281914 : D = 0x10325476;
56 1404281914 : E = 0xc3d2e1f0;
57 1404281914 : return 1;
58 : }
59 :
60 :
61 : #define F0(x,y,z) CRAYFIX((x & y) | (~x & z))
62 : #define F1(x,y,z) (x ^ y ^ z)
63 : #define F2(x,y,z) ((x & y) | (x & z) | (y & z))
64 : #define F3(x,y,z) F1(x,y,z)
65 :
66 : #define K0 0x5a827999
67 : #define K1 0x6ed9eba1
68 : #define K2 0x8f1bbcdc
69 : #define K3 0xca62c1d6
70 :
71 : #define DO(t,f,k) \
72 : do { \
73 : uint32_t temp; \
74 : \
75 : temp = cshift(AA, 5) + f(BB,CC,DD) + EE + data[t] + k; \
76 : EE = DD; \
77 : DD = CC; \
78 : CC = cshift(BB, 30); \
79 : BB = AA; \
80 : AA = temp; \
81 : } while(0)
82 :
83 : static inline void
84 3414859501 : calc (struct sha *m, uint32_t *in)
85 : {
86 64742025 : uint32_t AA, BB, CC, DD, EE;
87 64742025 : uint32_t data[80];
88 64742025 : int i;
89 :
90 3414859501 : AA = A;
91 3414859501 : BB = B;
92 3414859501 : CC = C;
93 3414859501 : DD = D;
94 3414859501 : EE = E;
95 :
96 58052611517 : for (i = 0; i < 16; ++i)
97 54637752016 : data[i] = in[i];
98 >22196*10^7 : for (i = 16; i < 80; ++i)
99 >21855*10^7 : data[i] = cshift(data[i-3] ^ data[i-8] ^ data[i-14] ^ data[i-16], 1);
100 :
101 : /* t=[0,19] */
102 :
103 3414859501 : DO(0,F0,K0);
104 3414859501 : DO(1,F0,K0);
105 3414859501 : DO(2,F0,K0);
106 3414859501 : DO(3,F0,K0);
107 3414859501 : DO(4,F0,K0);
108 3414859501 : DO(5,F0,K0);
109 3414859501 : DO(6,F0,K0);
110 3414859501 : DO(7,F0,K0);
111 3414859501 : DO(8,F0,K0);
112 3414859501 : DO(9,F0,K0);
113 3414859501 : DO(10,F0,K0);
114 3414859501 : DO(11,F0,K0);
115 3414859501 : DO(12,F0,K0);
116 3414859501 : DO(13,F0,K0);
117 3414859501 : DO(14,F0,K0);
118 3414859501 : DO(15,F0,K0);
119 3414859501 : DO(16,F0,K0);
120 3414859501 : DO(17,F0,K0);
121 3414859501 : DO(18,F0,K0);
122 3414859501 : DO(19,F0,K0);
123 :
124 : /* t=[20,39] */
125 :
126 3414859501 : DO(20,F1,K1);
127 3414859501 : DO(21,F1,K1);
128 3414859501 : DO(22,F1,K1);
129 3414859501 : DO(23,F1,K1);
130 3414859501 : DO(24,F1,K1);
131 3414859501 : DO(25,F1,K1);
132 3414859501 : DO(26,F1,K1);
133 3414859501 : DO(27,F1,K1);
134 3414859501 : DO(28,F1,K1);
135 3414859501 : DO(29,F1,K1);
136 3414859501 : DO(30,F1,K1);
137 3414859501 : DO(31,F1,K1);
138 3414859501 : DO(32,F1,K1);
139 3414859501 : DO(33,F1,K1);
140 3414859501 : DO(34,F1,K1);
141 3414859501 : DO(35,F1,K1);
142 3414859501 : DO(36,F1,K1);
143 3414859501 : DO(37,F1,K1);
144 3414859501 : DO(38,F1,K1);
145 3414859501 : DO(39,F1,K1);
146 :
147 : /* t=[40,59] */
148 :
149 3414859501 : DO(40,F2,K2);
150 3414859501 : DO(41,F2,K2);
151 3414859501 : DO(42,F2,K2);
152 3414859501 : DO(43,F2,K2);
153 3414859501 : DO(44,F2,K2);
154 3414859501 : DO(45,F2,K2);
155 3414859501 : DO(46,F2,K2);
156 3414859501 : DO(47,F2,K2);
157 3414859501 : DO(48,F2,K2);
158 3414859501 : DO(49,F2,K2);
159 3414859501 : DO(50,F2,K2);
160 3414859501 : DO(51,F2,K2);
161 3414859501 : DO(52,F2,K2);
162 3414859501 : DO(53,F2,K2);
163 3414859501 : DO(54,F2,K2);
164 3414859501 : DO(55,F2,K2);
165 3414859501 : DO(56,F2,K2);
166 3414859501 : DO(57,F2,K2);
167 3414859501 : DO(58,F2,K2);
168 3414859501 : DO(59,F2,K2);
169 :
170 : /* t=[60,79] */
171 :
172 3414859501 : DO(60,F3,K3);
173 3414859501 : DO(61,F3,K3);
174 3414859501 : DO(62,F3,K3);
175 3414859501 : DO(63,F3,K3);
176 3414859501 : DO(64,F3,K3);
177 3414859501 : DO(65,F3,K3);
178 3414859501 : DO(66,F3,K3);
179 3414859501 : DO(67,F3,K3);
180 3414859501 : DO(68,F3,K3);
181 3414859501 : DO(69,F3,K3);
182 3414859501 : DO(70,F3,K3);
183 3414859501 : DO(71,F3,K3);
184 3414859501 : DO(72,F3,K3);
185 3414859501 : DO(73,F3,K3);
186 3414859501 : DO(74,F3,K3);
187 3414859501 : DO(75,F3,K3);
188 3414859501 : DO(76,F3,K3);
189 3414859501 : DO(77,F3,K3);
190 3414859501 : DO(78,F3,K3);
191 3414859501 : DO(79,F3,K3);
192 :
193 3414859501 : A += AA;
194 3414859501 : B += BB;
195 3414859501 : C += CC;
196 3414859501 : D += DD;
197 3414859501 : E += EE;
198 3414859501 : }
199 :
200 : /*
201 : * From `Performance analysis of MD5' by Joseph D. Touch <touch@isi.edu>
202 : */
203 :
204 : #if !defined(WORDS_BIGENDIAN) || defined(_CRAY)
205 : static inline uint32_t
206 54119815816 : swap_uint32_t (uint32_t t)
207 : {
208 : #define ROL(x,n) ((x)<<(n))|((x)>>(32-(n)))
209 517936200 : uint32_t temp1, temp2;
210 :
211 54119815816 : temp1 = cshift(t, 16);
212 54119815816 : temp2 = temp1 >> 8;
213 54119815816 : temp1 &= 0x00ff00ff;
214 54119815816 : temp2 &= 0x00ff00ff;
215 54119815816 : temp1 <<= 8;
216 54119815816 : return temp1 | temp2;
217 : }
218 : #endif
219 :
220 : struct x32{
221 : unsigned int a:32;
222 : unsigned int b:32;
223 : };
224 :
225 : int
226 4037119548 : SHA1_Update (struct sha *m, const void *v, size_t len)
227 : {
228 4037119548 : const unsigned char *p = v;
229 4037119548 : size_t old_sz = m->sz[0];
230 81198446 : size_t offset;
231 :
232 4037119548 : m->sz[0] += len * 8;
233 4037119548 : if (m->sz[0] < old_sz)
234 0 : ++m->sz[1];
235 4037119548 : offset = (old_sz / 8) % 64;
236 8855569681 : while(len > 0){
237 4818450133 : size_t l = min(len, 64 - offset);
238 4818450133 : memcpy(m->save + offset, p, l);
239 4818450133 : offset += l;
240 4818450133 : p += l;
241 4818450133 : len -= l;
242 4818450133 : if(offset == 64){
243 : #if !defined(WORDS_BIGENDIAN) || defined(_CRAY)
244 : int i;
245 : uint32_t SHA1current[16];
246 3350117476 : struct x32 *us = (struct x32*)m->save;
247 30733735509 : for(i = 0; i < 8; i++){
248 27318876008 : SHA1current[2*i+0] = swap_uint32_t(us[i].a);
249 27318876008 : SHA1current[2*i+1] = swap_uint32_t(us[i].b);
250 : }
251 3414859501 : calc(m, SHA1current);
252 : #else
253 : calc(m, (uint32_t*)m->save);
254 : #endif
255 3414859501 : offset = 0;
256 : }
257 : }
258 4037119548 : return 1;
259 : }
260 :
261 : int
262 1404281914 : SHA1_Final (void *res, struct sha *m)
263 : {
264 28030340 : unsigned char zeros[72];
265 1404281914 : unsigned offset = (m->sz[0] / 8) % 64;
266 1404281914 : unsigned int dstart = (120 - offset - 1) % 64 + 1;
267 :
268 1404281914 : *zeros = 0x80;
269 1404281914 : memset (zeros + 1, 0, sizeof(zeros) - 1);
270 1404281914 : zeros[dstart+7] = (m->sz[0] >> 0) & 0xff;
271 1404281914 : zeros[dstart+6] = (m->sz[0] >> 8) & 0xff;
272 1404281914 : zeros[dstart+5] = (m->sz[0] >> 16) & 0xff;
273 1404281914 : zeros[dstart+4] = (m->sz[0] >> 24) & 0xff;
274 1404281914 : zeros[dstart+3] = (m->sz[1] >> 0) & 0xff;
275 1404281914 : zeros[dstart+2] = (m->sz[1] >> 8) & 0xff;
276 1404281914 : zeros[dstart+1] = (m->sz[1] >> 16) & 0xff;
277 1404281914 : zeros[dstart+0] = (m->sz[1] >> 24) & 0xff;
278 1404281914 : SHA1_Update (m, zeros, dstart + 8);
279 : {
280 28030340 : int i;
281 1404281914 : unsigned char *r = (unsigned char*)res;
282 :
283 8453721824 : for (i = 0; i < 5; ++i) {
284 7021409570 : r[4*i+3] = m->counter[i] & 0xFF;
285 7021409570 : r[4*i+2] = (m->counter[i] >> 8) & 0xFF;
286 7021409570 : r[4*i+1] = (m->counter[i] >> 16) & 0xFF;
287 7021409570 : r[4*i] = (m->counter[i] >> 24) & 0xFF;
288 : }
289 : }
290 : #if 0
291 : {
292 : int i;
293 : uint32_t *r = (uint32_t *)res;
294 :
295 : for (i = 0; i < 5; ++i)
296 : r[i] = swap_uint32_t (m->counter[i]);
297 : }
298 : #endif
299 1404281914 : return 1;
300 : }
|
