]> git.saurik.com Git - apple/xnu.git/blob - bsd/dev/random/YarrowCoreLib/src/sha1mod.c
xnu-344.49.tar.gz
[apple/xnu.git] / bsd / dev / random / YarrowCoreLib / src / sha1mod.c
1 /*
2 * Copyright (c) 1999, 2000-2001 Apple Computer, Inc. All rights reserved.
3 *
4 * @APPLE_LICENSE_HEADER_START@
5 *
6 * Copyright (c) 1999-2003 Apple Computer, Inc. All Rights Reserved.
7 *
8 * This file contains Original Code and/or Modifications of Original Code
9 * as defined in and that are subject to the Apple Public Source License
10 * Version 2.0 (the 'License'). You may not use this file except in
11 * compliance with the License. Please obtain a copy of the License at
12 * http://www.opensource.apple.com/apsl/ and read it before using this
13 * file.
14 *
15 * The Original Code and all software distributed under the License are
16 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
17 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
18 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
19 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
20 * Please see the License for the specific language governing rights and
21 * limitations under the License.
22 *
23 * @APPLE_LICENSE_HEADER_END@
24 */
25
26 /*
27 SHA-1 in C
28 By Steve Reid <steve@edmweb.com>
29 100% Public Domain
30 */
31 /* Header portion split from main code for convenience (AYB 3/02/98) */
32 #include "sha1mod.h"
33
34 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
35
36 /*
37 * Apple change...
38 */
39 #if defined(macintosh) || defined (__APPLE__)
40 #undef LITTLE_ENDIAN
41 #endif
42
43 /* blk0() and blk() perform the initial expand. */
44 /* I got the idea of expanding during the round function from SSLeay */
45 #ifdef LITTLE_ENDIAN
46 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
47 |(rol(block->l[i],8)&0x00FF00FF))
48 #else
49 #define blk0(i) block->l[i]
50 #endif
51 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
52 ^block->l[(i+2)&15]^block->l[i&15],1))
53
54 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
55 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
56 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
57 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
58 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
59 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
60
61
62 /* Hash a single 512-bit block. This is the core of the algorithm. */
63
64 void SHA1Transform(unsigned long state[5], unsigned char buffer[64])
65 {
66 unsigned long a, b, c, d, e;
67 typedef union {
68 unsigned char c[64];
69 unsigned long l[16];
70 } CHAR64LONG16;
71 CHAR64LONG16* block;
72 #ifdef SHA1HANDSOFF
73 static unsigned char workspace[64];
74 block = (CHAR64LONG16*)workspace;
75 memcpy(block, buffer, 64);
76 #else
77 block = (CHAR64LONG16*)buffer;
78 #endif
79 /* Copy context->state[] to working vars */
80 a = state[0];
81 b = state[1];
82 c = state[2];
83 d = state[3];
84 e = state[4];
85 /* 4 rounds of 20 operations each. Loop unrolled. */
86 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);
87 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);
88 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);
89 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);
90 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);
91 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);
92 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);
93 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);
94 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);
95 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);
96 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);
97 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);
98 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);
99 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);
100 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);
101 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);
102 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);
103 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);
104 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);
105 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);
106 /* Add the working vars back into context.state[] */
107 state[0] += a;
108 state[1] += b;
109 state[2] += c;
110 state[3] += d;
111 state[4] += e;
112 /* Wipe variables */
113 a = b = c = d = e = 0;
114 }
115
116
117 /* SHA1Init - Initialize new context */
118
119 void SHA1Init(SHA1_CTX* context)
120 {
121 /* SHA1 initialization constants */
122 context->state[0] = 0x67452301;
123 context->state[1] = 0xEFCDAB89;
124 context->state[2] = 0x98BADCFE;
125 context->state[3] = 0x10325476;
126 context->state[4] = 0xC3D2E1F0;
127 context->count[0] = context->count[1] = 0;
128 }
129
130
131 /* Run your data through this. */
132
133 void SHA1Update(SHA1_CTX* context, unsigned char* data, unsigned int len)
134 {
135 unsigned int i, j;
136
137 j = (context->count[0] >> 3) & 63;
138 if ((context->count[0] += len << 3) < (len << 3)) context->count[1]++;
139 context->count[1] += (len >> 29);
140 if ((j + len) > 63) {
141 memcpy(&context->buffer[j], data, (i = 64-j));
142 SHA1Transform(context->state, context->buffer);
143 for ( ; i + 63 < len; i += 64) {
144 SHA1Transform(context->state, &data[i]);
145 }
146 j = 0;
147 }
148 else i = 0;
149 memcpy(&context->buffer[j], &data[i], len - i);
150 }
151
152
153 /* Add padding and return the message digest. */
154
155 void SHA1Final(unsigned char digest[20], SHA1_CTX* context)
156 {
157 unsigned long i, j;
158 unsigned char finalcount[8];
159
160 for (i = 0; i < 8; i++) {
161 finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
162 >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */
163 }
164 SHA1Update(context, (unsigned char *)"\200", 1);
165 while ((context->count[0] & 504) != 448) {
166 SHA1Update(context, (unsigned char *)"\0", 1);
167 }
168 SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */
169 for (i = 0; i < 20; i++) {
170 digest[i] = (unsigned char)
171 ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
172 }
173 /* Wipe variables */
174 i = j = 0;
175 memset(context->buffer, 0, 64);
176 memset(context->state, 0, 20);
177 memset(context->count, 0, 8);
178 memset(finalcount, 0, 8);
179 #ifdef SHA1HANDSOFF /* make SHA1Transform overwrite it's own static vars */
180 SHA1Transform(context->state, context->buffer);
181 #endif
182 }
183
184
185 /*************************************************************/
186
187 /* Test Code */
188
189 #if 0
190
191 int main(int argc, char** argv)
192 {
193 int i, j;
194 SHA1_CTX context;
195 unsigned char digest[20], buffer[16384];
196 FILE* file;
197
198 if (argc > 2) {
199 puts("Public domain SHA-1 implementation - by Steve Reid <steve@edmweb.com>");
200 puts("Produces the SHA-1 hash of a file, or stdin if no file is specified.");
201 exit(0);
202 }
203 if (argc < 2) {
204 file = stdin;
205 }
206 else {
207 if (!(file = fopen(argv[1], "rb"))) {
208 fputs("Unable to open file.", stderr);
209 exit(-1);
210 }
211 }
212 SHA1Init(&context);
213 while (!feof(file)) { /* note: what if ferror(file) */
214 i = fread(buffer, 1, 16384, file);
215 SHA1Update(&context, buffer, i);
216 }
217 SHA1Final(digest, &context);
218 fclose(file);
219 for (i = 0; i < 5; i++) {
220 for (j = 0; j < 4; j++) {
221 printf("%02X", digest[i*4+j]);
222 }
223 putchar(' ');
224 }
225 putchar('\n');
226 exit(0);
227 }
228
229 #endif