shotgun/lib/sha1.c

   1 /*
   2 SHA-1 in C
   3 By Steve Reid <steve@edmweb.com>
   4 100% Public Domain
   5
   6 Test Vectors (from FIPS PUB 180-1)
   7 "abc"
   8   A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
   9 "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
  10   84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
  11 A million repetitions of "a"
  12   34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
  13 */
  14
  15 /*
  16
  17 Modified by Evan Phoenix to incorporate into Rubinius.
  18
  19 */
  20
  21 #define SHA1HANDSOFF /* Copies data before messing with it. */
  22
  23 #include <sys/types.h>
  24 #include <stdint.h>
  25 #include <stdio.h>
  26 #include <string.h>
  27
  28 #include "shotgun/config.h"
  29 #include "shotgun/lib/sha1.h"
  30
  31 #if !CONFIG_BIG_ENDIAN
  32 #define FLIP_DATA 1
  33 #endif
  34
  35 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
  36
  37 /* blk0() and blk() perform the initial expand. */
  38 /* I got the idea of expanding during the round function from SSLeay */
  39 #ifdef FLIP_DATA
  40 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
  41     |(rol(block->l[i],8)&0x00FF00FF))
  42 #else
  43 #define blk0(i) block->l[i]
  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 void SHA1Transform(uint32_t state[5], unsigned char buffer[64])
  59 {
  60 uint32_t a, b, c, d, e;
  61 typedef union {
  62     unsigned char c[64];
  63     uint32_t l[16];
  64 } CHAR64LONG16;
  65 CHAR64LONG16* block;
  66 #ifdef SHA1HANDSOFF
  67 static unsigned char workspace[64];
  68     block = (CHAR64LONG16*)workspace;
  69     memcpy(block, buffer, 64);
  70 #else
  71     block = (CHAR64LONG16*)buffer;
  72 #endif
  73     /* Copy context->state[] to working vars */
  74     a = state[0];
  75     b = state[1];
  76     c = state[2];
  77     d = state[3];
  78     e = state[4];
  79     /* 4 rounds of 20 operations each. Loop unrolled. */
  80     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);
  81     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);
  82     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);
  83     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);
  84     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);
  85     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);
  86     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);
  87     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);
  88     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);
  89     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);
  90     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);
  91     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);
  92     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);
  93     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);
  94     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);
  95     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);
  96     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);
  97     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);
  98     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);
  99     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);
 100     /* Add the working vars back into context.state[] */
 101     state[0] += a;
 102     state[1] += b;
 103     state[2] += c;
 104     state[3] += d;
 105     state[4] += e;
 106     /* Wipe variables */
 107     a = b = c = d = e = 0;
 108 }
 109
 110
 111 /* SHA1Init - Initialize new context */
 112
 113 void SHA1Init(SHA1_CTX* context)
 114 {
 115     /* SHA1 initialization constants */
 116     context->state[0] = 0x67452301;
 117     context->state[1] = 0xEFCDAB89;
 118     context->state[2] = 0x98BADCFE;
 119     context->state[3] = 0x10325476;
 120     context->state[4] = 0xC3D2E1F0;
 121     context->count[0] = context->count[1] = 0;
 122 }
 123
 124
 125 /* Run your data through this. */
 126
 127 void SHA1Update(SHA1_CTX* context, unsigned char* data, unsigned int len)
 128 {
 129 unsigned int i, j;
 130
 131     j = (context->count[0] >> 3) & 63;
 132     if ((context->count[0] += len << 3) < (len << 3)) context->count[1]++;
 133     context->count[1] += (len >> 29);
 134     if ((j + len) > 63) {
 135         memcpy(&context->buffer[j], data, (i = 64-j));
 136         SHA1Transform(context->state, context->buffer);
 137         for ( ; i + 63 < len; i += 64) {
 138             SHA1Transform(context->state, &data[i]);
 139         }
 140         j = 0;
 141     }
 142     else i = 0;
 143     memcpy(&context->buffer[j], &data[i], len - i);
 144 }
 145
 146
 147 /* Add padding and return the message digest. */
 148
 149 void SHA1Final(unsigned char digest[20], SHA1_CTX* context)
 150 {
 151 uint32_t i, j;
 152 unsigned char finalcount[8];
 153
 154     for (i = 0; i < 8; i++) {
 155         finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
 156          >> ((3-(i & 3)) * 8) ) & 255);  /* Endian independent */
 157     }
 158     SHA1Update(context, (unsigned char *)"\200", 1);
 159     while ((context->count[0] & 504) != 448) {
 160         SHA1Update(context, (unsigned char *)"\0", 1);
 161     }
 162     SHA1Update(context, finalcount, 8);  /* Should cause a SHA1Transform() */
 163     for (i = 0; i < 20; i++) {
 164         digest[i] = (unsigned char)
 165          ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
 166     }
 167     /* Wipe variables */
 168     i = j = 0;
 169     memset(context->buffer, 0, 64);
 170     memset(context->state, 0, 20);
 171     memset(context->count, 0, 8);
 172     memset(&finalcount, 0, 8);
 173 #ifdef SHA1HANDSOFF  /* make SHA1Transform overwrite it's own static vars */
 174     SHA1Transform(context->state, context->buffer);
 175 #endif
 176 }
 177
 178 /* rubinius specific */
 179 void sha1_hash_bstring(bstring input, unsigned char *digest) {
 180   SHA1_CTX context;
 181   SHA1Init(&context);
 182   SHA1Update(&context, (unsigned char*)bdatae(input,""), blength(input));
 183   SHA1Final(digest, &context);
 184 }
 185
 186 void sha1_hash_string(unsigned char *input, int len, unsigned char *digest) {
 187   SHA1_CTX context;
 188   SHA1Init(&context);
 189   SHA1Update(&context, input, len);
 190   SHA1Final(digest, &context);
 191 }
 192
 193 /*************************************************************/
 194
 195 #if 0
 196
 197 int main(int argc, char** argv)
 198 {
 199   int i, j;
 200   SHA1_CTX context;
 201   unsigned char digest[20];
 202   unsigned char data[] = "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq\n";
 203
 204   SHA1Init(&context);
 205
 206   SHA1Update(&context, data, sizeof(data) - 1);
 207
 208   SHA1Final(digest, &context);
 209   for (i = 0; i < 5; i++) {
 210     for (j = 0; j < 4; j++) {
 211       printf("%02x", digest[i*4+j]);
 212     }
 213   }
 214   putchar('\n');
 215   exit(0);
 216 }
 217
 218 #endif