pkgtools/digest/files/sha1.c

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