sha1.c revision 1.2.16.1 
1/*	sha1.c,v 1.2 2006/10/27 21:25:21 christos Exp	*/
2/*	$OpenBSD: sha1.c,v 1.9 1997/07/23 21:12:32 kstailey Exp $	*/
3
4/*
5 * SHA-1 in C
6 * By Steve Reid <steve@edmweb.com>
7 * 100% Public Domain
8 *
9 * Test Vectors (from FIPS PUB 180-1)
10 * "abc"
11 *   A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
12 * "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
13 *   84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
14 * A million repetitions of "a"
15 *   34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
16 */
17
18#define SHA1HANDSOFF		/* Copies data before messing with it. */
19
20#include <sys/cdefs.h>
21
22#if defined(_KERNEL) || defined(_STANDALONE)
23__KERNEL_RCSID(0, "sha1.c,v 1.2 2006/10/27 21:25:21 christos Exp");
24
25#include <lib/libkern/libkern.h>
26
27#else
28
29#if defined(LIBC_SCCS) && !defined(lint)
30__RCSID("sha1.c,v 1.2 2006/10/27 21:25:21 christos Exp");
31#endif /* LIBC_SCCS and not lint */
32
33#include "namespace.h"
34#include <assert.h>
35#include <string.h>
36
37#endif
38
39#include <sys/types.h>
40#include <sys/sha1.h>
41
42
43#if HAVE_NBTOOL_CONFIG_H
44#include "nbtool_config.h"
45#endif
46
47#if !HAVE_SHA1_H
48
49#define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
50
51/*
52 * blk0() and blk() perform the initial expand.
53 * I got the idea of expanding during the round function from SSLeay
54 */
55#if BYTE_ORDER == LITTLE_ENDIAN
56# define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
57    |(rol(block->l[i],8)&0x00FF00FF))
58#else
59# define blk0(i) block->l[i]
60#endif
61#define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
62    ^block->l[(i+2)&15]^block->l[i&15],1))
63
64/*
65 * (R0+R1), R2, R3, R4 are the different operations (rounds) used in SHA1
66 */
67#define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
68#define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
69#define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
70#define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
71#define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
72
73
74#if !defined(_KERNEL) && defined(__weak_alias)
75__weak_alias(SHA1Transform,_SHA1Transform)
76__weak_alias(SHA1Init,_SHA1Init)
77__weak_alias(SHA1Update,_SHA1Update)
78__weak_alias(SHA1Final,_SHA1Final)
79#endif
80
81typedef union {
82    u_char c[64];
83    u_int l[16];
84} CHAR64LONG16;
85
86/* old sparc64 gcc could not compile this */
87#undef SPARC64_GCC_WORKAROUND
88#if defined(__sparc64__) && defined(__GNUC__) && __GNUC__ < 3
89#define SPARC64_GCC_WORKAROUND
90#endif
91
92#ifdef SPARC64_GCC_WORKAROUND
93void do_R01(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e, CHAR64LONG16 *);
94void do_R2(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e, CHAR64LONG16 *);
95void do_R3(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e, CHAR64LONG16 *);
96void do_R4(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e, CHAR64LONG16 *);
97
98#define nR0(v,w,x,y,z,i) R0(*v,*w,*x,*y,*z,i)
99#define nR1(v,w,x,y,z,i) R1(*v,*w,*x,*y,*z,i)
100#define nR2(v,w,x,y,z,i) R2(*v,*w,*x,*y,*z,i)
101#define nR3(v,w,x,y,z,i) R3(*v,*w,*x,*y,*z,i)
102#define nR4(v,w,x,y,z,i) R4(*v,*w,*x,*y,*z,i)
103
104void
105do_R01(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e, CHAR64LONG16 *block)
106{
107    nR0(a,b,c,d,e, 0); nR0(e,a,b,c,d, 1); nR0(d,e,a,b,c, 2); nR0(c,d,e,a,b, 3);
108    nR0(b,c,d,e,a, 4); nR0(a,b,c,d,e, 5); nR0(e,a,b,c,d, 6); nR0(d,e,a,b,c, 7);
109    nR0(c,d,e,a,b, 8); nR0(b,c,d,e,a, 9); nR0(a,b,c,d,e,10); nR0(e,a,b,c,d,11);
110    nR0(d,e,a,b,c,12); nR0(c,d,e,a,b,13); nR0(b,c,d,e,a,14); nR0(a,b,c,d,e,15);
111    nR1(e,a,b,c,d,16); nR1(d,e,a,b,c,17); nR1(c,d,e,a,b,18); nR1(b,c,d,e,a,19);
112}
113
114void
115do_R2(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e, CHAR64LONG16 *block)
116{
117    nR2(a,b,c,d,e,20); nR2(e,a,b,c,d,21); nR2(d,e,a,b,c,22); nR2(c,d,e,a,b,23);
118    nR2(b,c,d,e,a,24); nR2(a,b,c,d,e,25); nR2(e,a,b,c,d,26); nR2(d,e,a,b,c,27);
119    nR2(c,d,e,a,b,28); nR2(b,c,d,e,a,29); nR2(a,b,c,d,e,30); nR2(e,a,b,c,d,31);
120    nR2(d,e,a,b,c,32); nR2(c,d,e,a,b,33); nR2(b,c,d,e,a,34); nR2(a,b,c,d,e,35);
121    nR2(e,a,b,c,d,36); nR2(d,e,a,b,c,37); nR2(c,d,e,a,b,38); nR2(b,c,d,e,a,39);
122}
123
124void
125do_R3(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e, CHAR64LONG16 *block)
126{
127    nR3(a,b,c,d,e,40); nR3(e,a,b,c,d,41); nR3(d,e,a,b,c,42); nR3(c,d,e,a,b,43);
128    nR3(b,c,d,e,a,44); nR3(a,b,c,d,e,45); nR3(e,a,b,c,d,46); nR3(d,e,a,b,c,47);
129    nR3(c,d,e,a,b,48); nR3(b,c,d,e,a,49); nR3(a,b,c,d,e,50); nR3(e,a,b,c,d,51);
130    nR3(d,e,a,b,c,52); nR3(c,d,e,a,b,53); nR3(b,c,d,e,a,54); nR3(a,b,c,d,e,55);
131    nR3(e,a,b,c,d,56); nR3(d,e,a,b,c,57); nR3(c,d,e,a,b,58); nR3(b,c,d,e,a,59);
132}
133
134void
135do_R4(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e, CHAR64LONG16 *block)
136{
137    nR4(a,b,c,d,e,60); nR4(e,a,b,c,d,61); nR4(d,e,a,b,c,62); nR4(c,d,e,a,b,63);
138    nR4(b,c,d,e,a,64); nR4(a,b,c,d,e,65); nR4(e,a,b,c,d,66); nR4(d,e,a,b,c,67);
139    nR4(c,d,e,a,b,68); nR4(b,c,d,e,a,69); nR4(a,b,c,d,e,70); nR4(e,a,b,c,d,71);
140    nR4(d,e,a,b,c,72); nR4(c,d,e,a,b,73); nR4(b,c,d,e,a,74); nR4(a,b,c,d,e,75);
141    nR4(e,a,b,c,d,76); nR4(d,e,a,b,c,77); nR4(c,d,e,a,b,78); nR4(b,c,d,e,a,79);
142}
143#endif
144
145/*
146 * Hash a single 512-bit block. This is the core of the algorithm.
147 */
148void SHA1Transform(state, buffer)
149    uint32_t state[5];
150    const u_char buffer[64];
151{
152    uint32_t a, b, c, d, e;
153    CHAR64LONG16 *block;
154
155#ifdef SHA1HANDSOFF
156    CHAR64LONG16 workspace;
157#endif
158
159    _DIAGASSERT(buffer != 0);
160    _DIAGASSERT(state != 0);
161
162#ifdef SHA1HANDSOFF
163    block = &workspace;
164    (void)memcpy(block, buffer, 64);
165#else
166    block = (CHAR64LONG16 *)(void *)buffer;
167#endif
168
169    /* Copy context->state[] to working vars */
170    a = state[0];
171    b = state[1];
172    c = state[2];
173    d = state[3];
174    e = state[4];
175
176#ifdef SPARC64_GCC_WORKAROUND
177    do_R01(&a, &b, &c, &d, &e, block);
178    do_R2(&a, &b, &c, &d, &e, block);
179    do_R3(&a, &b, &c, &d, &e, block);
180    do_R4(&a, &b, &c, &d, &e, block);
181#else
182    /* 4 rounds of 20 operations each. Loop unrolled. */
183    R0(a,b,c,d,e, 0); R0(e,a,b,c,d, 1); R0(d,e,a,b,c, 2); R0(c,d,e,a,b, 3);
184    R0(b,c,d,e,a, 4); R0(a,b,c,d,e, 5); R0(e,a,b,c,d, 6); R0(d,e,a,b,c, 7);
185    R0(c,d,e,a,b, 8); R0(b,c,d,e,a, 9); R0(a,b,c,d,e,10); R0(e,a,b,c,d,11);
186    R0(d,e,a,b,c,12); R0(c,d,e,a,b,13); R0(b,c,d,e,a,14); R0(a,b,c,d,e,15);
187    R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19);
188    R2(a,b,c,d,e,20); R2(e,a,b,c,d,21); R2(d,e,a,b,c,22); R2(c,d,e,a,b,23);
189    R2(b,c,d,e,a,24); R2(a,b,c,d,e,25); R2(e,a,b,c,d,26); R2(d,e,a,b,c,27);
190    R2(c,d,e,a,b,28); R2(b,c,d,e,a,29); R2(a,b,c,d,e,30); R2(e,a,b,c,d,31);
191    R2(d,e,a,b,c,32); R2(c,d,e,a,b,33); R2(b,c,d,e,a,34); R2(a,b,c,d,e,35);
192    R2(e,a,b,c,d,36); R2(d,e,a,b,c,37); R2(c,d,e,a,b,38); R2(b,c,d,e,a,39);
193    R3(a,b,c,d,e,40); R3(e,a,b,c,d,41); R3(d,e,a,b,c,42); R3(c,d,e,a,b,43);
194    R3(b,c,d,e,a,44); R3(a,b,c,d,e,45); R3(e,a,b,c,d,46); R3(d,e,a,b,c,47);
195    R3(c,d,e,a,b,48); R3(b,c,d,e,a,49); R3(a,b,c,d,e,50); R3(e,a,b,c,d,51);
196    R3(d,e,a,b,c,52); R3(c,d,e,a,b,53); R3(b,c,d,e,a,54); R3(a,b,c,d,e,55);
197    R3(e,a,b,c,d,56); R3(d,e,a,b,c,57); R3(c,d,e,a,b,58); R3(b,c,d,e,a,59);
198    R4(a,b,c,d,e,60); R4(e,a,b,c,d,61); R4(d,e,a,b,c,62); R4(c,d,e,a,b,63);
199    R4(b,c,d,e,a,64); R4(a,b,c,d,e,65); R4(e,a,b,c,d,66); R4(d,e,a,b,c,67);
200    R4(c,d,e,a,b,68); R4(b,c,d,e,a,69); R4(a,b,c,d,e,70); R4(e,a,b,c,d,71);
201    R4(d,e,a,b,c,72); R4(c,d,e,a,b,73); R4(b,c,d,e,a,74); R4(a,b,c,d,e,75);
202    R4(e,a,b,c,d,76); R4(d,e,a,b,c,77); R4(c,d,e,a,b,78); R4(b,c,d,e,a,79);
203#endif
204
205    /* Add the working vars back into context.state[] */
206    state[0] += a;
207    state[1] += b;
208    state[2] += c;
209    state[3] += d;
210    state[4] += e;
211
212    /* Wipe variables */
213    a = b = c = d = e = 0;
214}
215
216
217/*
218 * SHA1Init - Initialize new context
219 */
220void SHA1Init(context)
221    SHA1_CTX *context;
222{
223
224    _DIAGASSERT(context != 0);
225
226    /* SHA1 initialization constants */
227    context->state[0] = 0x67452301;
228    context->state[1] = 0xEFCDAB89;
229    context->state[2] = 0x98BADCFE;
230    context->state[3] = 0x10325476;
231    context->state[4] = 0xC3D2E1F0;
232    context->count[0] = context->count[1] = 0;
233}
234
235
236/*
237 * Run your data through this.
238 */
239void SHA1Update(context, data, len)
240    SHA1_CTX *context;
241    const u_char *data;
242    u_int len;
243{
244    u_int i, j;
245
246    _DIAGASSERT(context != 0);
247    _DIAGASSERT(data != 0);
248
249    j = context->count[0];
250    if ((context->count[0] += len << 3) < j)
251	context->count[1] += (len>>29)+1;
252    j = (j >> 3) & 63;
253    if ((j + len) > 63) {
254	(void)memcpy(&context->buffer[j], data, (i = 64-j));
255	SHA1Transform(context->state, context->buffer);
256	for ( ; i + 63 < len; i += 64)
257	    SHA1Transform(context->state, &data[i]);
258	j = 0;
259    } else {
260	i = 0;
261    }
262    (void)memcpy(&context->buffer[j], &data[i], len - i);
263}
264
265
266/*
267 * Add padding and return the message digest.
268 */
269void SHA1Final(digest, context)
270    u_char digest[20];
271    SHA1_CTX* context;
272{
273    u_int i;
274    u_char finalcount[8];
275
276    _DIAGASSERT(digest != 0);
277    _DIAGASSERT(context != 0);
278
279    for (i = 0; i < 8; i++) {
280	finalcount[i] = (u_char)((context->count[(i >= 4 ? 0 : 1)]
281	 >> ((3-(i & 3)) * 8) ) & 255);	 /* Endian independent */
282    }
283    SHA1Update(context, (const u_char *)"\200", 1);
284    while ((context->count[0] & 504) != 448)
285	SHA1Update(context, (const u_char *)"\0", 1);
286    SHA1Update(context, finalcount, 8);  /* Should cause a SHA1Transform() */
287
288    if (digest) {
289	for (i = 0; i < 20; i++)
290	    digest[i] = (u_char)
291		((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
292    }
293}
294
295#endif /* HAVE_SHA1_H */
296