sha1.c

   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 #include "sha1.h"
  28
  29 #ifndef BYTE_ORDER
  30 #if (BSD >= 199103)
  31 # include <machine/endian.h>
  32 #else
  33 #ifdef linux
  34 # include <endian.h>
  35 #else
  36 #define LITTLE_ENDIAN   1234    /* least-significant byte first (vax, pc) */
  37 #define BIG_ENDIAN      4321    /* most-significant byte first (IBM, net) */
  38 #define PDP_ENDIAN      3412    /* LSB first in word, MSW first in long (pdp)*/
  39
  40 #if defined(vax) || defined(ns32000) || defined(sun386) || defined(__i386__) || \
  41     defined(MIPSEL) || defined(_MIPSEL) || defined(BIT_ZERO_ON_RIGHT) || \
  42     defined(__alpha__) || defined(__alpha)
  43 #define BYTE_ORDER      LITTLE_ENDIAN
  44 #endif
  45
  46 #if defined(sel) || defined(pyr) || defined(mc68000) || defined(sparc) || \
  47     defined(is68k) || defined(tahoe) || defined(ibm032) || defined(ibm370) || \
  48     defined(MIPSEB) || defined(_MIPSEB) || defined(_IBMR2) || defined(DGUX) ||\
  49     defined(apollo) || defined(__convex__) || defined(_CRAY) || \
  50     defined(__hppa) || defined(__hp9000) || \
  51     defined(__hp9000s300) || defined(__hp9000s700) || \
  52     defined (BIT_ZERO_ON_LEFT) || defined(m68k)
  53 #define BYTE_ORDER      BIG_ENDIAN
  54 #endif
  55 #endif /* linux */
  56 #endif /* BSD */
  57 #endif /* BYTE_ORDER */
  58
  59 #if !defined(BYTE_ORDER) || \
  60     (BYTE_ORDER != BIG_ENDIAN && BYTE_ORDER != LITTLE_ENDIAN && \
  61     BYTE_ORDER != PDP_ENDIAN)
  62         /* you must determine what the correct bit order is for
  63          * your compiler - the next line is an intentional error
  64          * which will force your compiles to bomb until you fix
  65          * the above macros.
  66          */
  67   error "Undefined or invalid BYTE_ORDER";
  68 #endif
  69
  70 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
  71
  72 /* blk0() and blk() perform the initial expand. */
  73 /* I got the idea of expanding during the round function from SSLeay */
  74 #if BYTE_ORDER == LITTLE_ENDIAN
  75 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
  76     |(rol(block->l[i],8)&0x00FF00FF))
  77 #elif BYTE_ORDER == BIG_ENDIAN
  78 #define blk0(i) block->l[i]
  79 #else
  80 #error "Endianness not defined!"
  81 #endif
  82 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
  83     ^block->l[(i+2)&15]^block->l[i&15],1))
  84
  85 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
  86 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
  87 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
  88 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
  89 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
  90 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
  91
  92
  93 /* Hash a single 512-bit block. This is the core of the algorithm. */
  94
  95 void SHA1Transform(u_int32_t state[5], const unsigned char buffer[64])
  96 {
  97 u_int32_t a, b, c, d, e;
  98 typedef union {
  99     unsigned char c[64];
 100     u_int32_t l[16];
 101 } CHAR64LONG16;
 102 #ifdef SHA1HANDSOFF
 103 CHAR64LONG16 block[1];  /* use array to appear as a pointer */
 104     memcpy(block, buffer, 64);
 105 #else
 106     /* The following had better never be used because it causes the
 107      * pointer-to-const buffer to be cast into a pointer to non-const.
 108      * And the result is written through.  I threw a "const" in, hoping
 109      * this will cause a diagnostic.
 110      */
 111 CHAR64LONG16* block = (const CHAR64LONG16*)buffer;
 112 #endif
 113     /* Copy context->state[] to working vars */
 114     a = state[0];
 115     b = state[1];
 116     c = state[2];
 117     d = state[3];
 118     e = state[4];
 119     /* 4 rounds of 20 operations each. Loop unrolled. */
 120     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);
 121     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);
 122     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);
 123     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);
 124     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);
 125     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);
 126     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);
 127     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);
 128     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);
 129     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);
 130     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);
 131     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);
 132     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);
 133     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);
 134     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);
 135     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);
 136     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);
 137     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);
 138     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);
 139     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);
 140     /* Add the working vars back into context.state[] */
 141     state[0] += a;
 142     state[1] += b;
 143     state[2] += c;
 144     state[3] += d;
 145     state[4] += e;
 146     /* Wipe variables */
 147     a = b = c = d = e = 0;
 148 #ifdef SHA1HANDSOFF
 149     memset(block, '\0', sizeof(block));
 150 #endif
 151 }
 152
 153
 154 /* SHA1Init - Initialize new context */
 155
 156 void SHA1Init(SHA1_CTX* context)
 157 {
 158     /* SHA1 initialization constants */
 159     context->state[0] = 0x67452301;
 160     context->state[1] = 0xEFCDAB89;
 161     context->state[2] = 0x98BADCFE;
 162     context->state[3] = 0x10325476;
 163     context->state[4] = 0xC3D2E1F0;
 164     context->count[0] = context->count[1] = 0;
 165 }
 166
 167
 168 /* Run your data through this. */
 169
 170 void SHA1Update(SHA1_CTX* context, const unsigned char* data, u_int32_t len)
 171 {
 172 u_int32_t i;
 173 u_int32_t j;
 174
 175     j = context->count[0];
 176     if ((context->count[0] += len << 3) < j)
 177         context->count[1]++;
 178     context->count[1] += (len>>29);
 179     j = (j >> 3) & 63;
 180     if ((j + len) > 63) {
 181         memcpy(&context->buffer[j], data, (i = 64-j));
 182         SHA1Transform(context->state, context->buffer);
 183         for ( ; i + 63 < len; i += 64) {
 184             SHA1Transform(context->state, &data[i]);
 185         }
 186         j = 0;
 187     }
 188     else i = 0;
 189     memcpy(&context->buffer[j], &data[i], len - i);
 190 }
 191
 192
 193 /* Add padding and return the message digest. */
 194
 195 void SHA1Final(unsigned char digest[20], SHA1_CTX* context)
 196 {
 197 unsigned i;
 198 unsigned char finalcount[8];
 199 unsigned char c;
 200
 201 #if 0   /* untested "improvement" by DHR */
 202     /* Convert context->count to a sequence of bytes
 203      * in finalcount.  Second element first, but
 204      * big-endian order within element.
 205      * But we do it all backwards.
 206      */
 207     unsigned char *fcp = &finalcount[8];
 208
 209     for (i = 0; i < 2; i++)
 210     {
 211         u_int32_t t = context->count[i];
 212         int j;
 213
 214         for (j = 0; j < 4; t >>= 8, j++)
 215             *--fcp = (unsigned char) t
 216     }
 217 #else
 218     for (i = 0; i < 8; i++) {
 219         finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
 220          >> ((3-(i & 3)) * 8) ) & 255);  /* Endian independent */
 221     }
 222 #endif
 223     c = 0200;
 224     SHA1Update(context, &c, 1);
 225     while ((context->count[0] & 504) != 448) {
 226         c = 0000;
 227         SHA1Update(context, &c, 1);
 228     }
 229     SHA1Update(context, finalcount, 8);  /* Should cause a SHA1Transform() */
 230     for (i = 0; i < 20; i++) {
 231         digest[i] = (unsigned char)
 232          ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
 233     }
 234     /* Wipe variables */
 235     memset(context, '\0', sizeof(*context));
 236     memset(&finalcount, '\0', sizeof(finalcount));
 237 }
 238 /* ================ end of sha1.c ================ */
 239
 240 #if 0
 241 #define BUFSIZE 4096
 242
 243 int
 244 main(int argc, char **argv)
 245 {
 246     SHA1_CTX ctx;
 247     unsigned char hash[20], buf[BUFSIZE];
 248     int i;
 249
 250     for(i=0;i<BUFSIZE;i++)
 251         buf[i] = i;
 252
 253     SHA1Init(&ctx);
 254     for(i=0;i<1000;i++)
 255         SHA1Update(&ctx, buf, BUFSIZE);
 256     SHA1Final(hash, &ctx);
 257
 258     printf("SHA1=");
 259     for(i=0;i<20;i++)
 260         printf("%02x", hash[i]);
 261     printf("\n");
 262     return 0;
 263 }
 264
 265 #endif