3 By Steve Reid <sreid@sea-to-sky.net>
8 By James H. Brown <jbrown@burgoyne.com>
9 Still 100% Public Domain
11 Corrected a problem which generated improper hash values on 16 bit machines
12 Routine mono_sha1_update changed from
13 void mono_sha1_update(MonoSHA1Context* context, unsigned char* data, unsigned int
16 void mono_sha1_update(MonoSHA1Context* context, unsigned char* data, unsigned
19 The 'len' parameter was declared an int which works fine on 32 bit machines.
20 However, on 16 bit machines an int is too small for the shifts being done
22 it. This caused the hash function to generate incorrect values if len was
23 greater than 8191 (8K - 1) due to the 'len << 3' on line 3 of mono_sha1_update().
25 Since the file IO in main() reads 16K at a time, any file 8K or larger would
26 be guaranteed to generate the wrong hash (e.g. Test Vector #3, a million
29 I also changed the declaration of variables i & j in mono_sha1_update to
30 unsigned long from unsigned int for the same reason.
32 These changes should make no difference to any 32 bit implementations since
34 int and a long are the same size in those environments.
37 I also corrected a few compiler warnings generated by Borland C.
38 1. Added #include <process.h> for exit() prototype
39 2. Removed unused variable 'j' in mono_sha1_final
40 3. Changed exit(0) to return(0) at end of main.
42 ALL changes I made can be located by searching for comments containing 'JHB'
45 By Steve Reid <sreid@sea-to-sky.net>
46 Still 100% public domain
48 1- Removed #include <process.h> and used return() instead of exit()
49 2- Fixed overwriting of finalcount in mono_sha1_final() (discovered by Chris Hall)
50 3- Changed email address from steve@edmweb.com to sreid@sea-to-sky.net
54 By Saul Kravitz <Saul.Kravitz@celera.com>
56 Modified to run on Compaq Alpha hardware.
62 Test Vectors (from FIPS PUB 180-1)
64 A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
65 "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
66 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
67 A million repetitions of "a"
68 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
76 #include "mono-digest.h"
80 typedef guint32 uint32;
82 /* #include <process.h> */ /* prototype for exit() - JHB */
83 /* Using return() instead of exit() - SWR */
85 static void SHA1Transform(guint32 state[5], const guchar buffer[64]);
87 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
89 /* blk0() and blk() perform the initial expand. */
90 /* I got the idea of expanding during the round function from SSLeay */
91 #if G_BYTE_ORDER == G_LITTLE_ENDIAN
92 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
93 |(rol(block->l[i],8)&0x00FF00FF))
95 #define blk0(i) block->l[i]
97 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
98 ^block->l[(i+2)&15]^block->l[i&15],1))
100 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
101 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
102 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
103 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
104 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
105 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
108 #ifdef VERBOSE /* SAK */
109 static void SHAPrintContext(MonoSHA1Context *context, char *msg){
110 printf("%s (%d,%d) %x %x %x %x %x\n",
112 context->count[0], context->count[1],
121 /* Hash a single 512-bit block. This is the core of the algorithm. */
123 static void SHA1Transform(guint32 state[5], const guchar buffer[64])
125 uint32 a, b, c, d, e;
132 static unsigned char workspace[64];
133 block = (CHAR64LONG16*)workspace;
134 memcpy(block, buffer, 64);
136 block = (CHAR64LONG16*)buffer;
138 /* Copy context->state[] to working vars */
144 /* 4 rounds of 20 operations each. Loop unrolled. */
145 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);
146 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);
147 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);
148 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);
149 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);
150 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);
151 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);
152 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);
153 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);
154 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);
155 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);
156 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);
157 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);
158 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);
159 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);
160 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);
161 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);
162 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);
163 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);
164 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);
165 /* Add the working vars back into context.state[] */
172 a = b = c = d = e = 0;
176 /* mono_sha1_init - Initialize new context */
178 void mono_sha1_init(MonoSHA1Context* context)
180 /* SHA1 initialization constants */
181 context->state[0] = 0x67452301;
182 context->state[1] = 0xEFCDAB89;
183 context->state[2] = 0x98BADCFE;
184 context->state[3] = 0x10325476;
185 context->state[4] = 0xC3D2E1F0;
186 context->count[0] = context->count[1] = 0;
190 /* Run your data through this. */
192 void mono_sha1_update(MonoSHA1Context* context, const guchar* data, guint32 len) /*
195 uint32 i, j; /* JHB */
198 SHAPrintContext(context, "before");
200 j = (context->count[0] >> 3) & 63;
201 if ((context->count[0] += len << 3) < (len << 3)) context->count[1]++;
202 context->count[1] += (len >> 29);
203 if ((j + len) > 63) {
204 memcpy(&context->buffer[j], data, (i = 64-j));
205 SHA1Transform(context->state, context->buffer);
206 for ( ; i + 63 < len; i += 64) {
207 SHA1Transform(context->state, &data[i]);
212 memcpy(&context->buffer[j], &data[i], len - i);
214 SHAPrintContext(context, "after ");
219 /* Add padding and return the message digest. */
221 void mono_sha1_final( MonoSHA1Context* context, unsigned char digest[20])
224 unsigned char finalcount[8];
226 for (i = 0; i < 8; i++) {
227 finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
228 >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */
230 mono_sha1_update(context, (unsigned char *)"\200", 1);
231 while ((context->count[0] & 504) != 448) {
232 mono_sha1_update(context, (unsigned char *)"\0", 1);
234 mono_sha1_update(context, finalcount, 8); /* Should cause a SHA1Transform()
236 for (i = 0; i < 20; i++) {
237 digest[i] = (unsigned char)
238 ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
242 memset(context->buffer, 0, 64);
243 memset(context->state, 0, 20);
244 memset(context->count, 0, 8);
245 memset(finalcount, 0, 8); /* SWR */
246 #ifdef SHA1HANDSOFF /* make SHA1Transform overwrite it's own static vars */
247 SHA1Transform(context->state, context->buffer);
252 mono_sha1_get_digest (const gchar *buffer, gint buffer_size, guchar digest [20])
256 mono_sha1_init (&ctx);
257 mono_sha1_update (&ctx, buffer, buffer_size);
258 mono_sha1_final (&ctx, digest);
263 mono_sha1_get_digest_from_file (const gchar *filename, guchar digest [20])
266 guchar tmp_buf[1024];
270 mono_sha1_init (&ctx);
271 fp = fopen(filename, "r");
276 while ((nb_bytes_read = fread (tmp_buf, sizeof (guchar), 1024, fp)) > 0)
277 mono_sha1_update (&ctx, tmp_buf, nb_bytes_read);
286 mono_sha1_final (&ctx, digest);
290 * mono_digest_get_public_token:
292 * Get the public token from public key data.
293 * @token must point to at least 8 bytes of storage.
296 mono_digest_get_public_token (guchar* token, const guchar *pubkey, guint32 len)
301 g_return_if_fail (token != NULL);
302 mono_sha1_get_digest (pubkey, len, digest);
303 for (i = 0; i < 8; ++i)
304 token [i] = digest [19 - i];