lib/sha1.c

   1 /*      $OpenBSD: sha1.c,v 1.12 2003/07/21 20:37:08 millert Exp $       */
   2
   3 /*
   4  * SHA-1 in C
   5  * By Steve Reid <steve@edmweb.com>
   6  * 100% Public Domain
   7  *
   8  * Test Vectors (from FIPS PUB 180-1)
   9  * "abc"
  10  *   A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
  11  * "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
  12  *   84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
  13  * A million repetitions of "a"
  14  *   34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
  15  */
  16
  17 #if defined(LIBC_SCCS) && !defined(lint)
  18 static char rcsid[] = "$OpenBSD: sha1.c,v 1.12 2003/07/21 20:37:08 millert Exp $";
  19 #endif /* LIBC_SCCS and not lint */
  20
  21 #define SHA1HANDSOFF            /* Copies data before messing with it. */
  22
  23 #include <sys/param.h>
  24 #include <string.h>
  25 #include "sha1.h"
  26
  27 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
  28
  29 /*
  30  * blk0() and blk() perform the initial expand.
  31  * I got the idea of expanding during the round function from SSLeay
  32  */
  33 #if BYTE_ORDER == LITTLE_ENDIAN
  34 # define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
  35     |(rol(block->l[i],8)&0x00FF00FF))
  36 #else
  37 # define blk0(i) block->l[i]
  38 #endif
  39 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
  40     ^block->l[(i+2)&15]^block->l[i&15],1))
  41
  42 /*
  43  * (R0+R1), R2, R3, R4 are the different operations (rounds) used in SHA1
  44  */
  45 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
  46 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
  47 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
  48 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
  49 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
  50
  51 typedef union {
  52     u_char c[64];
  53     u_int l[16];
  54 } CHAR64LONG16;
  55
  56 #ifdef __sparc_v9__
  57 static void do_R01(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *);
  58 static void do_R2(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *);
  59 static void do_R3(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *);
  60 static void do_R4(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *);
  61
  62 #define nR0(v,w,x,y,z,i) R0(*v,*w,*x,*y,*z,i)
  63 #define nR1(v,w,x,y,z,i) R1(*v,*w,*x,*y,*z,i)
  64 #define nR2(v,w,x,y,z,i) R2(*v,*w,*x,*y,*z,i)
  65 #define nR3(v,w,x,y,z,i) R3(*v,*w,*x,*y,*z,i)
  66 #define nR4(v,w,x,y,z,i) R4(*v,*w,*x,*y,*z,i)
  67
  68 static void
  69 do_R01(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *block)
  70 {
  71     nR0(a,b,c,d,e, 0); nR0(e,a,b,c,d, 1); nR0(d,e,a,b,c, 2); nR0(c,d,e,a,b, 3);
  72     nR0(b,c,d,e,a, 4); nR0(a,b,c,d,e, 5); nR0(e,a,b,c,d, 6); nR0(d,e,a,b,c, 7);
  73     nR0(c,d,e,a,b, 8); nR0(b,c,d,e,a, 9); nR0(a,b,c,d,e,10); nR0(e,a,b,c,d,11);
  74     nR0(d,e,a,b,c,12); nR0(c,d,e,a,b,13); nR0(b,c,d,e,a,14); nR0(a,b,c,d,e,15);
  75     nR1(e,a,b,c,d,16); nR1(d,e,a,b,c,17); nR1(c,d,e,a,b,18); nR1(b,c,d,e,a,19);
  76 }
  77
  78 static void
  79 do_R2(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *block)
  80 {
  81     nR2(a,b,c,d,e,20); nR2(e,a,b,c,d,21); nR2(d,e,a,b,c,22); nR2(c,d,e,a,b,23);
  82     nR2(b,c,d,e,a,24); nR2(a,b,c,d,e,25); nR2(e,a,b,c,d,26); nR2(d,e,a,b,c,27);
  83     nR2(c,d,e,a,b,28); nR2(b,c,d,e,a,29); nR2(a,b,c,d,e,30); nR2(e,a,b,c,d,31);
  84     nR2(d,e,a,b,c,32); nR2(c,d,e,a,b,33); nR2(b,c,d,e,a,34); nR2(a,b,c,d,e,35);
  85     nR2(e,a,b,c,d,36); nR2(d,e,a,b,c,37); nR2(c,d,e,a,b,38); nR2(b,c,d,e,a,39);
  86 }
  87
  88 static void
  89 do_R3(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *block)
  90 {
  91     nR3(a,b,c,d,e,40); nR3(e,a,b,c,d,41); nR3(d,e,a,b,c,42); nR3(c,d,e,a,b,43);
  92     nR3(b,c,d,e,a,44); nR3(a,b,c,d,e,45); nR3(e,a,b,c,d,46); nR3(d,e,a,b,c,47);
  93     nR3(c,d,e,a,b,48); nR3(b,c,d,e,a,49); nR3(a,b,c,d,e,50); nR3(e,a,b,c,d,51);
  94     nR3(d,e,a,b,c,52); nR3(c,d,e,a,b,53); nR3(b,c,d,e,a,54); nR3(a,b,c,d,e,55);
  95     nR3(e,a,b,c,d,56); nR3(d,e,a,b,c,57); nR3(c,d,e,a,b,58); nR3(b,c,d,e,a,59);
  96 }
  97
  98 static void
  99 do_R4(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *block)
 100 {
 101     nR4(a,b,c,d,e,60); nR4(e,a,b,c,d,61); nR4(d,e,a,b,c,62); nR4(c,d,e,a,b,63);
 102     nR4(b,c,d,e,a,64); nR4(a,b,c,d,e,65); nR4(e,a,b,c,d,66); nR4(d,e,a,b,c,67);
 103     nR4(c,d,e,a,b,68); nR4(b,c,d,e,a,69); nR4(a,b,c,d,e,70); nR4(e,a,b,c,d,71);
 104     nR4(d,e,a,b,c,72); nR4(c,d,e,a,b,73); nR4(b,c,d,e,a,74); nR4(a,b,c,d,e,75);
 105     nR4(e,a,b,c,d,76); nR4(d,e,a,b,c,77); nR4(c,d,e,a,b,78); nR4(b,c,d,e,a,79);
 106 }
 107 #endif
 108
 109 /*
 110  * Hash a single 512-bit block. This is the core of the algorithm.
 111  */
 112 void
 113 SHA1Transform(u_int32_t state[5], const u_char buffer[64])
 114 {
 115     u_int32_t a, b, c, d, e;
 116     CHAR64LONG16 *block;
 117
 118 #ifdef SHA1HANDSOFF
 119     CHAR64LONG16 workspace;
 120     block = &workspace;
 121     (void)memcpy(block, buffer, 64);
 122 #else
 123     block = (CHAR64LONG16 *)buffer;
 124 #endif
 125
 126     /* Copy context->state[] to working vars */
 127     a = state[0];
 128     b = state[1];
 129     c = state[2];
 130     d = state[3];
 131     e = state[4];
 132
 133 #ifdef __sparc_v9__
 134     do_R01(&a, &b, &c, &d, &e, block);
 135     do_R2(&a, &b, &c, &d, &e, block);
 136     do_R3(&a, &b, &c, &d, &e, block);
 137     do_R4(&a, &b, &c, &d, &e, block);
 138 #else
 139     /* 4 rounds of 20 operations each. Loop unrolled. */
 140     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);
 141     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);
 142     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);
 143     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);
 144     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);
 145     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);
 146     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);
 147     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);
 148     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);
 149     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);
 150     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);
 151     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);
 152     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);
 153     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);
 154     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);
 155     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);
 156     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);
 157     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);
 158     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);
 159     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);
 160 #endif
 161
 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
 169     /* Wipe variables */
 170     a = b = c = d = e = 0;
 171 }
 172
 173
 174 /*
 175  * SHA1Init - Initialize new context
 176  */
 177 void
 178 SHA1Init(SHA1_CTX *context)
 179 {
 180
 181     /* SHA1 initialization constants */
 182     context->state[0] = 0x67452301;
 183     context->state[1] = 0xEFCDAB89;
 184     context->state[2] = 0x98BADCFE;
 185     context->state[3] = 0x10325476;
 186     context->state[4] = 0xC3D2E1F0;
 187     context->count[0] = context->count[1] = 0;
 188 }
 189
 190
 191 /*
 192  * Run your data through this.
 193  */
 194 void
 195 SHA1Update(SHA1_CTX *context, const u_char *data, u_int len)
 196 {
 197     u_int i, j;
 198
 199     j = context->count[0];
 200     if ((context->count[0] += len << 3) < j)
 201         context->count[1] += (len>>29)+1;
 202     j = (j >> 3) & 63;
 203     if ((j + len) > 63) {
 204         (void)memcpy(&context->buffer[j], data, (i = 64-j));
 205         SHA1Transform(context->state, context->buffer);
 206         for ( ; i + 63 < len; i += 64)
 207             SHA1Transform(context->state, &data[i]);
 208         j = 0;
 209     } else {
 210         i = 0;
 211     }
 212     (void)memcpy(&context->buffer[j], &data[i], len - i);
 213 }
 214
 215
 216 /*
 217  * Add padding and return the message digest.
 218  */
 219 void
 220 SHA1Final(u_char digest[20], SHA1_CTX *context)
 221 {
 222     u_int i;
 223     u_char finalcount[8];
 224
 225     for (i = 0; i < 8; i++) {
 226         finalcount[i] = (u_char)((context->count[(i >= 4 ? 0 : 1)]
 227          >> ((3-(i & 3)) * 8) ) & 255);  /* Endian independent */
 228     }
 229     SHA1Update(context, (u_char *)"\200", 1);
 230     while ((context->count[0] & 504) != 448)
 231         SHA1Update(context, (u_char *)"\0", 1);
 232     SHA1Update(context, finalcount, 8);  /* Should cause a SHA1Transform() */
 233
 234     if (digest) {
 235         for (i = 0; i < 20; i++)
 236             digest[i] = (u_char)
 237                 ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
 238     }
 239 }