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