none/tests/sha1_test.c

   1
   2 /*
   3 Stick the enclosed text in a file "sha1.test.c".
   4
   5 Here is a sample run:
   6     hugh $ cc sha1.test.c
   7     hugh $ valgrind ./a.out
   8     ==26189== valgrind-20020227, a memory error detector for x86 GNU/Linux.
   9     ==26189== Copyright (C) 2000-200x, and GNU GPL'd, by Julian Seward.
  10     ==26189== For more details, rerun with: -v
  11     ==26189==
  12
  13     valgrind: vg_main.c:495 (vgPlain_create_translation_for): Assertion `trans_size > 0 && trans_size < 65536' failed.
  14     Please report this bug to me at: jseward@acm.org
  15
  16     hugh $ valgrind --instrument=no ./a.out
  17     ==26209== valgrind-20020227, a memory error detector for x86 GNU/Linux.
  18     ==26209== Copyright (C) 2000-200x, and GNU GPL'd, by Julian Seward.
  19     ==26209== For more details, rerun with: -v
  20     ==26209==
  21     ==26209==
  22
  23 */
  24
  25 /* ================ sha1.c ================ */
  26 /*
  27 SHA-1 in C
  28 By Steve Reid <steve@edmweb.com>
  29 100% Public Domain
  30
  31 Test Vectors (from FIPS PUB 180-1)
  32 "abc"
  33   A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
  34 "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
  35   84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
  36 A million repetitions of "a"
  37   34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
  38 */
  39
  40 /* #define LITTLE_ENDIAN * This should be #define'd already, if true. */
  41 /* #define SHA1HANDSOFF * Copies data before messing with it. */
  42
  43 #define SHA1HANDSOFF
  44
  45 #include <config.h>
  46
  47 #include <string.h>
  48 #include <sys/types.h>  /* for u_int*_t */
  49
  50 /* ================ sha1.h ================ */
  51 /*
  52 SHA-1 in C
  53 By Steve Reid <steve@edmweb.com>
  54 100% Public Domain
  55 */
  56
  57 typedef struct {
  58     u_int32_t state[5];
  59     u_int32_t count[2];
  60     unsigned char buffer[64];
  61 } SHA1_CTX;
  62
  63 void SHA1Transform(u_int32_t state[5], const unsigned char buffer[64]);
  64 void SHA1Init(SHA1_CTX* context);
  65 void SHA1Update(SHA1_CTX* context, const unsigned char* data, u_int32_t len);
  66 void SHA1Final(unsigned char digest[20], SHA1_CTX* context);
  67 /* ================ end of sha1.h ================ */
  68
  69 #ifdef HAVE_SYS_ENDIAN_H
  70 #include <sys/endian.h>
  71 #endif
  72
  73 #ifdef HAVE_ENDIAN_H
  74 #include <endian.h>
  75 #endif
  76
  77 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
  78
  79 /* blk0() and blk() perform the initial expand. */
  80 /* I got the idea of expanding during the round function from SSLeay */
  81 #if BYTE_ORDER == LITTLE_ENDIAN
  82 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
  83     |(rol(block->l[i],8)&0x00FF00FF))
  84 #elif BYTE_ORDER == BIG_ENDIAN
  85 #define blk0(i) block->l[i]
  86 #else
  87 #error "Endianness not defined!"
  88 #endif
  89 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
  90     ^block->l[(i+2)&15]^block->l[i&15],1))
  91
  92 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
  93 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
  94 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
  95 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
  96 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
  97 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
  98
  99
 100 /* Hash a single 512-bit block. This is the core of the algorithm. */
 101
 102 void SHA1Transform(u_int32_t state[5], const unsigned char buffer[64])
 103 {
 104 u_int32_t a, b, c, d, e;
 105 typedef union {
 106     unsigned char c[64];
 107     u_int32_t l[16];
 108 } CHAR64LONG16;
 109 #ifdef SHA1HANDSOFF
 110 CHAR64LONG16 block[1];  /* use array to appear as a pointer */
 111     memcpy(block, buffer, 64);
 112 #else
 113     /* The following had better never be used because it causes the
 114      * pointer-to-const buffer to be cast into a pointer to non-const.
 115      * And the result is written through.  I threw a "const" in, hoping
 116      * this will cause a diagnostic.
 117      */
 118 CHAR64LONG16* block = (const CHAR64LONG16*)buffer;
 119 #endif
 120     /* Copy context->state[] to working vars */
 121     a = state[0];
 122     b = state[1];
 123     c = state[2];
 124     d = state[3];
 125     e = state[4];
 126     /* 4 rounds of 20 operations each. Loop unrolled. */
 127     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);
 128     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);
 129     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);
 130     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);
 131     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);
 132     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);
 133     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);
 134     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);
 135     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);
 136     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);
 137     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);
 138     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);
 139     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);
 140     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);
 141     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);
 142     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);
 143     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);
 144     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);
 145     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);
 146     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);
 147     /* Add the working vars back into context.state[] */
 148     state[0] += a;
 149     state[1] += b;
 150     state[2] += c;
 151     state[3] += d;
 152     state[4] += e;
 153     /* Wipe variables */
 154     a = b = c = d = e = 0;
 155 #ifdef SHA1HANDSOFF
 156     memset(block, '\0', sizeof(block));
 157 #endif
 158 }
 159
 160
 161 /* SHA1Init - Initialize new context */
 162
 163 void SHA1Init(SHA1_CTX* context)
 164 {
 165     /* SHA1 initialization constants */
 166     context->state[0] = 0x67452301;
 167     context->state[1] = 0xEFCDAB89;
 168     context->state[2] = 0x98BADCFE;
 169     context->state[3] = 0x10325476;
 170     context->state[4] = 0xC3D2E1F0;
 171     context->count[0] = context->count[1] = 0;
 172 }
 173
 174
 175 /* Run your data through this. */
 176
 177 void SHA1Update(SHA1_CTX* context, const unsigned char* data, u_int32_t len)
 178 {
 179 u_int32_t i;
 180 u_int32_t j;
 181
 182     j = context->count[0];
 183     if ((context->count[0] += len << 3) < j)
 184         context->count[1]++;
 185     context->count[1] += (len>>29);
 186     j = (j >> 3) & 63;
 187     if ((j + len) > 63) {
 188         memcpy(&context->buffer[j], data, (i = 64-j));
 189         SHA1Transform(context->state, context->buffer);
 190         for ( ; i + 63 < len; i += 64) {
 191             SHA1Transform(context->state, &data[i]);
 192         }
 193         j = 0;
 194     }
 195     else i = 0;
 196     memcpy(&context->buffer[j], &data[i], len - i);
 197 }
 198
 199
 200 /* Add padding and return the message digest. */
 201
 202 void SHA1Final(unsigned char digest[20], SHA1_CTX* context)
 203 {
 204 unsigned i;
 205 unsigned char finalcount[8];
 206 unsigned char c;
 207
 208 #if 0   /* untested "improvement" by DHR */
 209     /* Convert context->count to a sequence of bytes
 210      * in finalcount.  Second element first, but
 211      * big-endian order within element.
 212      * But we do it all backwards.
 213      */
 214     unsigned char *fcp = &finalcount[8];
 215
 216     for (i = 0; i < 2; i++)
 217     {
 218         u_int32_t t = context->count[i];
 219         int j;
 220
 221         for (j = 0; j < 4; t >>= 8, j++)
 222             *--fcp = (unsigned char) t
 223     }
 224 #else
 225     for (i = 0; i < 8; i++) {
 226         finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
 227          >> ((3-(i & 3)) * 8) ) & 255);  /* Endian independent */
 228     }
 229 #endif
 230     c = 0200;
 231     SHA1Update(context, &c, 1);
 232     while ((context->count[0] & 504) != 448) {
 233         c = 0000;
 234         SHA1Update(context, &c, 1);
 235     }
 236     SHA1Update(context, finalcount, 8);  /* Should cause a SHA1Transform() */
 237     for (i = 0; i < 20; i++) {
 238         digest[i] = (unsigned char)
 239          ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
 240     }
 241     /* Wipe variables */
 242     memset(context, '\0', sizeof(*context));
 243     memset(&finalcount, '\0', sizeof(finalcount));
 244 }
 245 /* ================ end of sha1.c ================ */
 246
 247 int
 248 main(int argc, char **argv)
 249 {
 250     SHA1_CTX ctx;
 251     unsigned char hash[20];
 252     unsigned char abc[] = "abc";
 253
 254     SHA1Init(&ctx);
 255     SHA1Update(&ctx, abc, 3);
 256     SHA1Final(hash, &ctx);
 257     return 0;
 258 }
 259
 260