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