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