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"
78 #if HAVE_COMMONCRYPTO_COMMONDIGEST_H
81 mono_sha1_init (MonoSHA1Context* context)
83 CC_SHA1_Init (context);
87 mono_sha1_update (MonoSHA1Context* context, const guchar* data, guint32 len)
89 CC_SHA1_Update (context, data, len);
93 mono_sha1_final (MonoSHA1Context* context, unsigned char digest[20])
95 CC_SHA1_Final (digest, context);
100 /* #include <process.h> */ /* prototype for exit() - JHB */
101 /* Using return() instead of exit() - SWR */
103 static void SHA1Transform(guint32 state[5], const guchar buffer[64]);
105 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
107 /* blk0() and blk() perform the initial expand. */
108 /* I got the idea of expanding during the round function from SSLeay */
109 #if G_BYTE_ORDER == G_LITTLE_ENDIAN
110 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
111 |(rol(block->l[i],8)&0x00FF00FF))
113 #define blk0(i) block->l[i]
115 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
116 ^block->l[(i+2)&15]^block->l[i&15],1))
118 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
119 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
120 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
121 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
122 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
123 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
126 #ifdef VERBOSE /* SAK */
127 static void SHAPrintContext(MonoSHA1Context *context, char *msg){
128 printf("%s (%d,%d) %x %x %x %x %x\n",
130 context->count[0], context->count[1],
139 /* Hash a single 512-bit block. This is the core of the algorithm. */
141 static void SHA1Transform(guint32 state[5], const guchar buffer[64])
143 guint32 a, b, c, d, e;
150 static unsigned char workspace[64];
151 block = (CHAR64LONG16*)workspace;
152 memcpy(block, buffer, 64);
154 block = (CHAR64LONG16*)buffer;
156 /* Copy context->state[] to working vars */
162 /* 4 rounds of 20 operations each. Loop unrolled. */
163 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);
164 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);
165 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);
166 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);
167 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);
168 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);
169 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);
170 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);
171 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);
172 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);
173 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);
174 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);
175 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);
176 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);
177 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);
178 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);
179 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);
180 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);
181 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);
182 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);
183 /* Add the working vars back into context.state[] */
190 a = b = c = d = e = 0;
194 /* mono_sha1_init - Initialize new context */
196 void mono_sha1_init(MonoSHA1Context* context)
198 /* SHA1 initialization constants */
199 context->state[0] = 0x67452301;
200 context->state[1] = 0xEFCDAB89;
201 context->state[2] = 0x98BADCFE;
202 context->state[3] = 0x10325476;
203 context->state[4] = 0xC3D2E1F0;
204 context->count[0] = context->count[1] = 0;
208 /* Run your data through this. */
210 void mono_sha1_update(MonoSHA1Context* context, const guchar* data, guint32 len) /*
213 guint32 i, j; /* JHB */
216 SHAPrintContext(context, "before");
218 j = (context->count[0] >> 3) & 63;
219 if ((context->count[0] += len << 3) < (len << 3)) context->count[1]++;
220 context->count[1] += (len >> 29);
221 if ((j + len) > 63) {
222 memcpy(&context->buffer[j], data, (i = 64-j));
223 SHA1Transform(context->state, context->buffer);
224 for ( ; i + 63 < len; i += 64) {
225 SHA1Transform(context->state, &data[i]);
230 memcpy(&context->buffer[j], &data[i], len - i);
232 SHAPrintContext(context, "after ");
237 /* Add padding and return the message digest. */
239 void mono_sha1_final( MonoSHA1Context* context, unsigned char digest[20])
242 unsigned char finalcount[8];
244 for (i = 0; i < 8; i++) {
245 finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
246 >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */
248 mono_sha1_update(context, (unsigned char *)"\200", 1);
249 while ((context->count[0] & 504) != 448) {
250 mono_sha1_update(context, (unsigned char *)"\0", 1);
252 mono_sha1_update(context, finalcount, 8); /* Should cause a SHA1Transform()
254 for (i = 0; i < 20; i++) {
255 digest[i] = (unsigned char)
256 ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
260 memset(context->buffer, 0, 64);
261 memset(context->state, 0, 20);
262 memset(context->count, 0, 8);
263 memset(finalcount, 0, 8); /* SWR */
264 #ifdef SHA1HANDSOFF /* make SHA1Transform overwrite it's own static vars */
265 SHA1Transform(context->state, context->buffer);
272 mono_sha1_get_digest (const guchar *buffer, gint buffer_size, guchar digest [20])
276 mono_sha1_init (&ctx);
277 mono_sha1_update (&ctx, buffer, buffer_size);
278 mono_sha1_final (&ctx, digest);
283 * mono_sha1_get_digest_from_file: get the sha1 hash of a file
284 * @filename: file name
285 * @digest: 20 bytes buffer receiving the hash code.
287 * Get the sha1 hash of a file. The result is put in
288 * the 20 bytes buffer @digest .
290 * If an IO error happens the value in @digest is not updated.
293 mono_sha1_get_digest_from_file (const gchar *filename, guchar digest [20])
296 guchar tmp_buf[1024];
300 mono_sha1_init (&ctx);
301 fp = fopen(filename, "r");
306 while ((nb_bytes_read = fread (tmp_buf, sizeof (guchar), 1024, fp)) > 0)
307 mono_sha1_update (&ctx, tmp_buf, nb_bytes_read);
316 mono_sha1_final (&ctx, digest);
320 * mono_digest_get_public_token:
322 * Get the public token from public key data.
323 * @token must point to at least 8 bytes of storage.
326 mono_digest_get_public_token (guchar* token, const guchar *pubkey, guint32 len)
331 g_return_if_fail (token != NULL);
332 mono_sha1_get_digest (pubkey, len, digest);
333 for (i = 0; i < 8; ++i)
334 token [i] = digest [19 - i];