mono/utils/mono-sha1.c

   1 /*
   2 SHA-1 in C
   3 By Steve Reid <sreid@sea-to-sky.net>
   4 100% Public Domain
   5
   6 -----------------
   7 Modified 7/98
   8 By James H. Brown <jbrown@burgoyne.com>
   9 Still 100% Public Domain
  10
  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
  14 len)
  15 to
  16         void mono_sha1_update(MonoSHA1Context* context, unsigned char* data, unsigned
  17 long len)
  18
  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
  21 against
  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().
  24
  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
  27 "a"s).
  28
  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.
  31
  32 These changes should make no difference to any 32 bit implementations since
  33 an
  34 int and a long are the same size in those environments.
  35
  36 --
  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.
  41
  42 ALL changes I made can be located by searching for comments containing 'JHB'
  43 -----------------
  44 Modified 8/98
  45 By Steve Reid <sreid@sea-to-sky.net>
  46 Still 100% public domain
  47
  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
  51
  52 -----------------
  53 Modified 4/01
  54 By Saul Kravitz <Saul.Kravitz@celera.com>
  55 Still 100% PD
  56 Modified to run on Compaq Alpha hardware.
  57
  58
  59 */
  60
  61 /*
  62 Test Vectors (from FIPS PUB 180-1)
  63 "abc"
  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
  69 */
  70
  71 #define SHA1HANDSOFF
  72
  73 #include <stdio.h>
  74 #include <string.h>
  75 #include <glib.h>
  76 #include "mono-digest.h"
  77
  78
  79 /* #include <process.h> */      /* prototype for exit() - JHB */
  80 /* Using return() instead of exit() - SWR */
  81
  82 static void SHA1Transform(guint32 state[5], const guchar buffer[64]);
  83
  84 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
  85
  86 /* blk0() and blk() perform the initial expand. */
  87 /* I got the idea of expanding during the round function from SSLeay */
  88 #if G_BYTE_ORDER == G_LITTLE_ENDIAN
  89 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
  90     |(rol(block->l[i],8)&0x00FF00FF))
  91 #else
  92 #define blk0(i) block->l[i]
  93 #endif
  94 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
  95     ^block->l[(i+2)&15]^block->l[i&15],1))
  96
  97 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
  98 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
  99 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
 100 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
 101 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
 102 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
 103
 104
 105 #ifdef VERBOSE  /* SAK */
 106 static void SHAPrintContext(MonoSHA1Context *context, char *msg){
 107   printf("%s (%d,%d) %x %x %x %x %x\n",
 108          msg,
 109          context->count[0], context->count[1],
 110          context->state[0],
 111          context->state[1],
 112          context->state[2],
 113          context->state[3],
 114          context->state[4]);
 115 }
 116 #endif
 117
 118 /* Hash a single 512-bit block. This is the core of the algorithm. */
 119
 120 static void SHA1Transform(guint32 state[5], const guchar buffer[64])
 121 {
 122 guint32 a, b, c, d, e;
 123 typedef union {
 124     unsigned char c[64];
 125     guint32 l[16];
 126 } CHAR64LONG16;
 127 CHAR64LONG16* block;
 128 #ifdef SHA1HANDSOFF
 129 static unsigned char workspace[64];
 130     block = (CHAR64LONG16*)workspace;
 131     memcpy(block, buffer, 64);
 132 #else
 133     block = (CHAR64LONG16*)buffer;
 134 #endif
 135     /* Copy context->state[] to working vars */
 136     a = state[0];
 137     b = state[1];
 138     c = state[2];
 139     d = state[3];
 140     e = state[4];
 141     /* 4 rounds of 20 operations each. Loop unrolled. */
 142     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);
 143     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);
 144     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);
 145     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);
 146     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);
 147     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);
 148     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);
 149     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);
 150     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);
 151     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);
 152     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);
 153     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);
 154     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);
 155     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);
 156     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);
 157     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);
 158     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);
 159     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);
 160     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);
 161     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);
 162     /* Add the working vars back into context.state[] */
 163     state[0] += a;
 164     state[1] += b;
 165     state[2] += c;
 166     state[3] += d;
 167     state[4] += e;
 168     /* Wipe variables */
 169     a = b = c = d = e = 0;
 170 }
 171
 172
 173 /* mono_sha1_init - Initialize new context */
 174
 175 void mono_sha1_init(MonoSHA1Context* context)
 176 {
 177     /* SHA1 initialization constants */
 178     context->state[0] = 0x67452301;
 179     context->state[1] = 0xEFCDAB89;
 180     context->state[2] = 0x98BADCFE;
 181     context->state[3] = 0x10325476;
 182     context->state[4] = 0xC3D2E1F0;
 183     context->count[0] = context->count[1] = 0;
 184 }
 185
 186
 187 /* Run your data through this. */
 188
 189 void mono_sha1_update(MonoSHA1Context* context, const guchar* data, guint32 len)        /*
 190 JHB */
 191 {
 192 guint32 i, j;   /* JHB */
 193
 194 #ifdef VERBOSE
 195     SHAPrintContext(context, "before");
 196 #endif
 197     j = (context->count[0] >> 3) & 63;
 198     if ((context->count[0] += len << 3) < (len << 3)) context->count[1]++;
 199     context->count[1] += (len >> 29);
 200     if ((j + len) > 63) {
 201         memcpy(&context->buffer[j], data, (i = 64-j));
 202         SHA1Transform(context->state, context->buffer);
 203         for ( ; i + 63 < len; i += 64) {
 204             SHA1Transform(context->state, &data[i]);
 205         }
 206         j = 0;
 207     }
 208     else i = 0;
 209     memcpy(&context->buffer[j], &data[i], len - i);
 210 #ifdef VERBOSE
 211     SHAPrintContext(context, "after ");
 212 #endif
 213 }
 214
 215
 216 /* Add padding and return the message digest. */
 217
 218 void mono_sha1_final( MonoSHA1Context* context, unsigned char digest[20])
 219 {
 220 guint32 i;      /* JHB */
 221 unsigned char finalcount[8];
 222
 223     for (i = 0; i < 8; i++) {
 224         finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
 225          >> ((3-(i & 3)) * 8) ) & 255);  /* Endian independent */
 226     }
 227     mono_sha1_update(context, (unsigned char *)"\200", 1);
 228     while ((context->count[0] & 504) != 448) {
 229         mono_sha1_update(context, (unsigned char *)"\0", 1);
 230     }
 231     mono_sha1_update(context, finalcount, 8);  /* Should cause a SHA1Transform()
 232 */
 233     for (i = 0; i < 20; i++) {
 234         digest[i] = (unsigned char)
 235          ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
 236     }
 237     /* Wipe variables */
 238     i = 0;      /* JHB */
 239     memset(context->buffer, 0, 64);
 240     memset(context->state, 0, 20);
 241     memset(context->count, 0, 8);
 242     memset(finalcount, 0, 8);   /* SWR */
 243 #ifdef SHA1HANDSOFF  /* make SHA1Transform overwrite it's own static vars */
 244     SHA1Transform(context->state, context->buffer);
 245 #endif
 246 }
 247
 248 void
 249 mono_sha1_get_digest (const guchar *buffer, gint buffer_size, guchar digest [20])
 250 {
 251         MonoSHA1Context ctx;
 252
 253         mono_sha1_init (&ctx);
 254         mono_sha1_update (&ctx, buffer, buffer_size);
 255         mono_sha1_final (&ctx, digest);
 256
 257 }
 258
 259 void
 260 mono_sha1_get_digest_from_file (const gchar *filename, guchar digest [20])
 261 {
 262         MonoSHA1Context ctx;
 263         guchar tmp_buf[1024];
 264         gint nb_bytes_read;
 265         FILE *fp;
 266
 267         mono_sha1_init (&ctx);
 268         fp = fopen(filename, "r");
 269         if (!fp) {
 270                 return;
 271         }
 272
 273         while ((nb_bytes_read = fread (tmp_buf, sizeof (guchar), 1024, fp)) > 0)
 274                 mono_sha1_update (&ctx, tmp_buf, nb_bytes_read);
 275
 276         if (ferror(fp)) {
 277                 fclose(fp);
 278                 return;
 279         } else {
 280                 fclose(fp);
 281         }
 282
 283         mono_sha1_final (&ctx, digest);
 284 }
 285
 286 /*
 287  * mono_digest_get_public_token:
 288  *
 289  * Get the public token from public key data.
 290  * @token must point to at least 8 bytes of storage.
 291  */
 292 void
 293 mono_digest_get_public_token (guchar* token, const guchar *pubkey, guint32 len)
 294 {
 295         guchar digest [20];
 296         int i;
 297
 298         g_return_if_fail (token != NULL);
 299         mono_sha1_get_digest (pubkey, len, digest);
 300         for (i = 0; i < 8; ++i)
 301                 token [i] = digest [19 - i];
 302 }
 303