root / tests / sha1.c @ 36bb244b
History | View | Annotate | Download (7.4 kB)
1 | 03d5f74a | bellard | |
---|---|---|---|
2 | 03d5f74a | bellard | /* from valgrind tests */
|
3 | 03d5f74a | bellard | |
4 | 03d5f74a | bellard | /* ================ sha1.c ================ */
|
5 | 03d5f74a | bellard | /*
|
6 | 03d5f74a | bellard | SHA-1 in C
|
7 | 03d5f74a | bellard | By Steve Reid <steve@edmweb.com>
|
8 | 03d5f74a | bellard | 100% Public Domain
|
9 | 03d5f74a | bellard | |
10 | 03d5f74a | bellard | Test Vectors (from FIPS PUB 180-1)
|
11 | 03d5f74a | bellard | "abc"
|
12 | 03d5f74a | bellard | A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
|
13 | 03d5f74a | bellard | "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
|
14 | 03d5f74a | bellard | 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
|
15 | 03d5f74a | bellard | A million repetitions of "a"
|
16 | 03d5f74a | bellard | 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
|
17 | 03d5f74a | bellard | */
|
18 | 03d5f74a | bellard | |
19 | 03d5f74a | bellard | /* #define LITTLE_ENDIAN * This should be #define'd already, if true. */
|
20 | 03d5f74a | bellard | /* #define SHA1HANDSOFF * Copies data before messing with it. */
|
21 | 03d5f74a | bellard | |
22 | 03d5f74a | bellard | #define SHA1HANDSOFF
|
23 | 03d5f74a | bellard | |
24 | 03d5f74a | bellard | #include <stdio.h> |
25 | 03d5f74a | bellard | #include <string.h> |
26 | 03d5f74a | bellard | #include <sys/types.h> /* for u_int*_t */ |
27 | 03d5f74a | bellard | |
28 | 03d5f74a | bellard | /* ================ sha1.h ================ */
|
29 | 03d5f74a | bellard | /*
|
30 | 03d5f74a | bellard | SHA-1 in C
|
31 | 03d5f74a | bellard | By Steve Reid <steve@edmweb.com>
|
32 | 03d5f74a | bellard | 100% Public Domain
|
33 | 03d5f74a | bellard | */
|
34 | 03d5f74a | bellard | |
35 | 03d5f74a | bellard | typedef struct { |
36 | 03d5f74a | bellard | u_int32_t state[5];
|
37 | 03d5f74a | bellard | u_int32_t count[2];
|
38 | 03d5f74a | bellard | unsigned char buffer[64]; |
39 | 03d5f74a | bellard | } SHA1_CTX; |
40 | 03d5f74a | bellard | |
41 | 03d5f74a | bellard | void SHA1Transform(u_int32_t state[5], const unsigned char buffer[64]); |
42 | 03d5f74a | bellard | void SHA1Init(SHA1_CTX* context);
|
43 | 03d5f74a | bellard | void SHA1Update(SHA1_CTX* context, const unsigned char* data, u_int32_t len); |
44 | 03d5f74a | bellard | void SHA1Final(unsigned char digest[20], SHA1_CTX* context); |
45 | 03d5f74a | bellard | /* ================ end of sha1.h ================ */
|
46 | 03d5f74a | bellard | #include <endian.h> |
47 | 03d5f74a | bellard | |
48 | 03d5f74a | bellard | #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits)))) |
49 | 03d5f74a | bellard | |
50 | 03d5f74a | bellard | /* blk0() and blk() perform the initial expand. */
|
51 | 03d5f74a | bellard | /* I got the idea of expanding during the round function from SSLeay */
|
52 | 03d5f74a | bellard | #if BYTE_ORDER == LITTLE_ENDIAN
|
53 | 03d5f74a | bellard | #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \ |
54 | 03d5f74a | bellard | |(rol(block->l[i],8)&0x00FF00FF)) |
55 | 03d5f74a | bellard | #elif BYTE_ORDER == BIG_ENDIAN
|
56 | 03d5f74a | bellard | #define blk0(i) block->l[i]
|
57 | 03d5f74a | bellard | #else
|
58 | 03d5f74a | bellard | #error "Endianness not defined!" |
59 | 03d5f74a | bellard | #endif
|
60 | 03d5f74a | bellard | #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \ |
61 | 03d5f74a | bellard | ^block->l[(i+2)&15]^block->l[i&15],1)) |
62 | 03d5f74a | bellard | |
63 | 03d5f74a | bellard | /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
|
64 | 03d5f74a | bellard | #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30); |
65 | 03d5f74a | bellard | #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30); |
66 | 03d5f74a | bellard | #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30); |
67 | 03d5f74a | bellard | #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30); |
68 | 03d5f74a | bellard | #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30); |
69 | 03d5f74a | bellard | |
70 | 03d5f74a | bellard | |
71 | 03d5f74a | bellard | /* Hash a single 512-bit block. This is the core of the algorithm. */
|
72 | 03d5f74a | bellard | |
73 | 03d5f74a | bellard | void SHA1Transform(u_int32_t state[5], const unsigned char buffer[64]) |
74 | 03d5f74a | bellard | { |
75 | 03d5f74a | bellard | u_int32_t a, b, c, d, e; |
76 | 03d5f74a | bellard | typedef union { |
77 | 03d5f74a | bellard | unsigned char c[64]; |
78 | 03d5f74a | bellard | u_int32_t l[16];
|
79 | 03d5f74a | bellard | } CHAR64LONG16; |
80 | 03d5f74a | bellard | #ifdef SHA1HANDSOFF
|
81 | 03d5f74a | bellard | CHAR64LONG16 block[1]; /* use array to appear as a pointer */ |
82 | 03d5f74a | bellard | memcpy(block, buffer, 64);
|
83 | 03d5f74a | bellard | #else
|
84 | 03d5f74a | bellard | /* The following had better never be used because it causes the
|
85 | 03d5f74a | bellard | * pointer-to-const buffer to be cast into a pointer to non-const.
|
86 | 03d5f74a | bellard | * And the result is written through. I threw a "const" in, hoping
|
87 | 03d5f74a | bellard | * this will cause a diagnostic.
|
88 | 03d5f74a | bellard | */
|
89 | 03d5f74a | bellard | CHAR64LONG16* block = (const CHAR64LONG16*)buffer;
|
90 | 03d5f74a | bellard | #endif
|
91 | 03d5f74a | bellard | /* Copy context->state[] to working vars */
|
92 | 03d5f74a | bellard | a = state[0];
|
93 | 03d5f74a | bellard | b = state[1];
|
94 | 03d5f74a | bellard | c = state[2];
|
95 | 03d5f74a | bellard | d = state[3];
|
96 | 03d5f74a | bellard | e = state[4];
|
97 | 03d5f74a | bellard | /* 4 rounds of 20 operations each. Loop unrolled. */
|
98 | 03d5f74a | bellard | 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); |
99 | 03d5f74a | bellard | 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); |
100 | 03d5f74a | bellard | 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); |
101 | 03d5f74a | bellard | 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); |
102 | 03d5f74a | bellard | 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); |
103 | 03d5f74a | bellard | 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); |
104 | 03d5f74a | bellard | 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); |
105 | 03d5f74a | bellard | 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); |
106 | 03d5f74a | bellard | 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); |
107 | 03d5f74a | bellard | 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); |
108 | 03d5f74a | bellard | 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); |
109 | 03d5f74a | bellard | 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); |
110 | 03d5f74a | bellard | 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); |
111 | 03d5f74a | bellard | 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); |
112 | 03d5f74a | bellard | 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); |
113 | 03d5f74a | bellard | 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); |
114 | 03d5f74a | bellard | 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); |
115 | 03d5f74a | bellard | 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); |
116 | 03d5f74a | bellard | 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); |
117 | 03d5f74a | bellard | 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); |
118 | 03d5f74a | bellard | /* Add the working vars back into context.state[] */
|
119 | 03d5f74a | bellard | state[0] += a;
|
120 | 03d5f74a | bellard | state[1] += b;
|
121 | 03d5f74a | bellard | state[2] += c;
|
122 | 03d5f74a | bellard | state[3] += d;
|
123 | 03d5f74a | bellard | state[4] += e;
|
124 | 03d5f74a | bellard | /* Wipe variables */
|
125 | 03d5f74a | bellard | a = b = c = d = e = 0;
|
126 | 03d5f74a | bellard | #ifdef SHA1HANDSOFF
|
127 | 03d5f74a | bellard | memset(block, '\0', sizeof(block)); |
128 | 03d5f74a | bellard | #endif
|
129 | 03d5f74a | bellard | } |
130 | 03d5f74a | bellard | |
131 | 03d5f74a | bellard | |
132 | 03d5f74a | bellard | /* SHA1Init - Initialize new context */
|
133 | 03d5f74a | bellard | |
134 | 03d5f74a | bellard | void SHA1Init(SHA1_CTX* context)
|
135 | 03d5f74a | bellard | { |
136 | 03d5f74a | bellard | /* SHA1 initialization constants */
|
137 | 03d5f74a | bellard | context->state[0] = 0x67452301; |
138 | 03d5f74a | bellard | context->state[1] = 0xEFCDAB89; |
139 | 03d5f74a | bellard | context->state[2] = 0x98BADCFE; |
140 | 03d5f74a | bellard | context->state[3] = 0x10325476; |
141 | 03d5f74a | bellard | context->state[4] = 0xC3D2E1F0; |
142 | 03d5f74a | bellard | context->count[0] = context->count[1] = 0; |
143 | 03d5f74a | bellard | } |
144 | 03d5f74a | bellard | |
145 | 03d5f74a | bellard | |
146 | 03d5f74a | bellard | /* Run your data through this. */
|
147 | 03d5f74a | bellard | |
148 | 03d5f74a | bellard | void SHA1Update(SHA1_CTX* context, const unsigned char* data, u_int32_t len) |
149 | 03d5f74a | bellard | { |
150 | 03d5f74a | bellard | u_int32_t i; |
151 | 03d5f74a | bellard | u_int32_t j; |
152 | 03d5f74a | bellard | |
153 | 03d5f74a | bellard | j = context->count[0];
|
154 | 03d5f74a | bellard | if ((context->count[0] += len << 3) < j) |
155 | 03d5f74a | bellard | context->count[1]++;
|
156 | 03d5f74a | bellard | context->count[1] += (len>>29); |
157 | 03d5f74a | bellard | j = (j >> 3) & 63; |
158 | 03d5f74a | bellard | if ((j + len) > 63) { |
159 | 03d5f74a | bellard | memcpy(&context->buffer[j], data, (i = 64-j));
|
160 | 03d5f74a | bellard | SHA1Transform(context->state, context->buffer); |
161 | 03d5f74a | bellard | for ( ; i + 63 < len; i += 64) { |
162 | 03d5f74a | bellard | SHA1Transform(context->state, &data[i]); |
163 | 03d5f74a | bellard | } |
164 | 03d5f74a | bellard | j = 0;
|
165 | 03d5f74a | bellard | } |
166 | 03d5f74a | bellard | else i = 0; |
167 | 03d5f74a | bellard | memcpy(&context->buffer[j], &data[i], len - i); |
168 | 03d5f74a | bellard | } |
169 | 03d5f74a | bellard | |
170 | 03d5f74a | bellard | |
171 | 03d5f74a | bellard | /* Add padding and return the message digest. */
|
172 | 03d5f74a | bellard | |
173 | 03d5f74a | bellard | void SHA1Final(unsigned char digest[20], SHA1_CTX* context) |
174 | 03d5f74a | bellard | { |
175 | 03d5f74a | bellard | unsigned i;
|
176 | 03d5f74a | bellard | unsigned char finalcount[8]; |
177 | 03d5f74a | bellard | unsigned char c; |
178 | 03d5f74a | bellard | |
179 | 03d5f74a | bellard | #if 0 /* untested "improvement" by DHR */
|
180 | 03d5f74a | bellard | /* Convert context->count to a sequence of bytes
|
181 | 03d5f74a | bellard | * in finalcount. Second element first, but
|
182 | 03d5f74a | bellard | * big-endian order within element.
|
183 | 03d5f74a | bellard | * But we do it all backwards.
|
184 | 03d5f74a | bellard | */
|
185 | 03d5f74a | bellard | unsigned char *fcp = &finalcount[8];
|
186 | 03d5f74a | bellard | |
187 | 03d5f74a | bellard | for (i = 0; i < 2; i++)
|
188 | 03d5f74a | bellard | {
|
189 | 03d5f74a | bellard | u_int32_t t = context->count[i];
|
190 | 03d5f74a | bellard | int j;
|
191 | 03d5f74a | bellard | |
192 | 03d5f74a | bellard | for (j = 0; j < 4; t >>= 8, j++)
|
193 | 03d5f74a | bellard | *--fcp = (unsigned char) t
|
194 | 03d5f74a | bellard | }
|
195 | 03d5f74a | bellard | #else
|
196 | 03d5f74a | bellard | for (i = 0; i < 8; i++) { |
197 | 03d5f74a | bellard | finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)] |
198 | 03d5f74a | bellard | >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */ |
199 | 03d5f74a | bellard | } |
200 | 03d5f74a | bellard | #endif
|
201 | 03d5f74a | bellard | c = 0200;
|
202 | 03d5f74a | bellard | SHA1Update(context, &c, 1);
|
203 | 03d5f74a | bellard | while ((context->count[0] & 504) != 448) { |
204 | 03d5f74a | bellard | c = 0000;
|
205 | 03d5f74a | bellard | SHA1Update(context, &c, 1);
|
206 | 03d5f74a | bellard | } |
207 | 03d5f74a | bellard | SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */ |
208 | 03d5f74a | bellard | for (i = 0; i < 20; i++) { |
209 | 03d5f74a | bellard | digest[i] = (unsigned char) |
210 | 03d5f74a | bellard | ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255); |
211 | 03d5f74a | bellard | } |
212 | 03d5f74a | bellard | /* Wipe variables */
|
213 | 03d5f74a | bellard | memset(context, '\0', sizeof(*context)); |
214 | 03d5f74a | bellard | memset(&finalcount, '\0', sizeof(finalcount)); |
215 | 03d5f74a | bellard | } |
216 | 03d5f74a | bellard | /* ================ end of sha1.c ================ */
|
217 | 03d5f74a | bellard | |
218 | 03d5f74a | bellard | #define BUFSIZE 4096 |
219 | 03d5f74a | bellard | |
220 | 03d5f74a | bellard | int
|
221 | 03d5f74a | bellard | main(int argc, char **argv) |
222 | 03d5f74a | bellard | { |
223 | 03d5f74a | bellard | SHA1_CTX ctx; |
224 | 03d5f74a | bellard | unsigned char hash[20], buf[BUFSIZE]; |
225 | 03d5f74a | bellard | int i;
|
226 | 03d5f74a | bellard | |
227 | 03d5f74a | bellard | for(i=0;i<BUFSIZE;i++) |
228 | 03d5f74a | bellard | buf[i] = i; |
229 | 03d5f74a | bellard | |
230 | 03d5f74a | bellard | SHA1Init(&ctx); |
231 | 03d5f74a | bellard | for(i=0;i<1000;i++) |
232 | 03d5f74a | bellard | SHA1Update(&ctx, buf, BUFSIZE); |
233 | 03d5f74a | bellard | SHA1Final(hash, &ctx); |
234 | 03d5f74a | bellard | |
235 | 03d5f74a | bellard | printf("SHA1=");
|
236 | 03d5f74a | bellard | for(i=0;i<20;i++) |
237 | 03d5f74a | bellard | printf("%02x", hash[i]);
|
238 | 03d5f74a | bellard | printf("\n");
|
239 | 03d5f74a | bellard | return 0; |
240 | 03d5f74a | bellard | } |
241 | 03d5f74a | bellard |