2 * Copyright (c) 1995 - 2001 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
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.
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.
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
39 #define A m->counter[0]
40 #define B m->counter[1]
41 #define C m->counter[2]
42 #define D m->counter[3]
43 #define E m->counter[4]
47 SHA1_Init (struct sha *m)
59 #define F0(x,y,z) CRAYFIX((x & y) | (~x & z))
60 #define F1(x,y,z) (x ^ y ^ z)
61 #define F2(x,y,z) ((x & y) | (x & z) | (y & z))
62 #define F3(x,y,z) F1(x,y,z)
73 temp = cshift(AA, 5) + f(BB,CC,DD) + EE + data[t] + k; \
76 CC = cshift(BB, 30); \
82 calc (struct sha *m, uint32_t *in)
84 uint32_t AA, BB, CC, DD, EE;
94 for (i = 0; i < 16; ++i)
96 for (i = 16; i < 80; ++i)
97 data[i] = cshift(data[i-3] ^ data[i-8] ^ data[i-14] ^ data[i-16], 1);
199 * From `Performance analysis of MD5' by Joseph D. Touch <touch@isi.edu>
202 #if !defined(WORDS_BIGENDIAN) || defined(_CRAY)
203 static inline uint32_t
204 swap_uint32_t (uint32_t t)
206 #define ROL(x,n) ((x)<<(n))|((x)>>(32-(n)))
207 uint32_t temp1, temp2;
209 temp1 = cshift(t, 16);
214 return temp1 | temp2;
224 SHA1_Update (struct sha *m, const void *v, size_t len)
226 const unsigned char *p = v;
227 size_t old_sz = m->sz[0];
231 if (m->sz[0] < old_sz)
233 offset = (old_sz / 8) % 64;
235 size_t l = min(len, 64 - offset);
236 memcpy(m->save + offset, p, l);
241 #if !defined(WORDS_BIGENDIAN) || defined(_CRAY)
243 uint32_t current[16];
244 struct x32 *us = (struct x32*)m->save;
245 for(i = 0; i < 8; i++){
246 current[2*i+0] = swap_uint32_t(us[i].a);
247 current[2*i+1] = swap_uint32_t(us[i].b);
251 calc(m, (uint32_t*)m->save);
259 SHA1_Final (void *res, struct sha *m)
261 unsigned char zeros[72];
262 unsigned offset = (m->sz[0] / 8) % 64;
263 unsigned int dstart = (120 - offset - 1) % 64 + 1;
266 memset (zeros + 1, 0, sizeof(zeros) - 1);
267 zeros[dstart+7] = (m->sz[0] >> 0) & 0xff;
268 zeros[dstart+6] = (m->sz[0] >> 8) & 0xff;
269 zeros[dstart+5] = (m->sz[0] >> 16) & 0xff;
270 zeros[dstart+4] = (m->sz[0] >> 24) & 0xff;
271 zeros[dstart+3] = (m->sz[1] >> 0) & 0xff;
272 zeros[dstart+2] = (m->sz[1] >> 8) & 0xff;
273 zeros[dstart+1] = (m->sz[1] >> 16) & 0xff;
274 zeros[dstart+0] = (m->sz[1] >> 24) & 0xff;
275 SHA1_Update (m, zeros, dstart + 8);
278 unsigned char *r = (unsigned char*)res;
280 for (i = 0; i < 5; ++i) {
281 r[4*i+3] = m->counter[i] & 0xFF;
282 r[4*i+2] = (m->counter[i] >> 8) & 0xFF;
283 r[4*i+1] = (m->counter[i] >> 16) & 0xFF;
284 r[4*i] = (m->counter[i] >> 24) & 0xFF;
290 uint32_t *r = (uint32_t *)res;
292 for (i = 0; i < 5; ++i)
293 r[i] = swap_uint32_t (m->counter[i]);