external/bsd/bind/dist/lib/isc/sha1.c

   1 /*      $NetBSD$        */
   2
   3 /*
   4  * Copyright (C) 2004, 2005, 2007, 2009  Internet Systems Consortium, Inc. ("ISC")
   5  * Copyright (C) 2000, 2001, 2003  Internet Software Consortium.
   6  *
   7  * Permission to use, copy, modify, and/or distribute this software for any
   8  * purpose with or without fee is hereby granted, provided that the above
   9  * copyright notice and this permission notice appear in all copies.
  10  *
  11  * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES WITH
  12  * REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
  13  * AND FITNESS.  IN NO EVENT SHALL ISC BE LIABLE FOR ANY SPECIAL, DIRECT,
  14  * INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
  15  * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
  16  * OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
  17  * PERFORMANCE OF THIS SOFTWARE.
  18  */
  19
  20 /* Id: sha1.c,v 1.20 2009/02/06 23:47:42 tbox Exp */
  21
  22 /*      $NetBSD: sha1.c,v 1.5 2000/01/22 22:19:14 mycroft Exp $ */
  23 /*      $OpenBSD: sha1.c,v 1.9 1997/07/23 21:12:32 kstailey Exp $       */
  24
  25 /*! \file
  26  * SHA-1 in C
  27  * \author By Steve Reid <steve@edmweb.com>
  28  * 100% Public Domain
  29  * \verbatim
  30  * Test Vectors (from FIPS PUB 180-1)
  31  * "abc"
  32  *   A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
  33  * "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
  34  *   84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
  35  * A million repetitions of "a"
  36  *   34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
  37  * \endverbatim
  38  */
  39
  40 #include "config.h"
  41
  42 #include <isc/assertions.h>
  43 #include <isc/platform.h>
  44 #include <isc/sha1.h>
  45 #include <isc/string.h>
  46 #include <isc/types.h>
  47 #include <isc/util.h>
  48
  49 #ifdef ISC_PLATFORM_OPENSSLHASH
  50
  51 void
  52 isc_sha1_init(isc_sha1_t *context)
  53 {
  54         INSIST(context != NULL);
  55
  56         EVP_DigestInit(context, EVP_sha1());
  57 }
  58
  59 void
  60 isc_sha1_invalidate(isc_sha1_t *context) {
  61         EVP_MD_CTX_cleanup(context);
  62 }
  63
  64 void
  65 isc_sha1_update(isc_sha1_t *context, const unsigned char *data,
  66                 unsigned int len)
  67 {
  68         INSIST(context != 0);
  69         INSIST(data != 0);
  70
  71         EVP_DigestUpdate(context, (const void *) data, (size_t) len);
  72 }
  73
  74 void
  75 isc_sha1_final(isc_sha1_t *context, unsigned char *digest) {
  76         INSIST(digest != 0);
  77         INSIST(context != 0);
  78
  79         EVP_DigestFinal(context, digest, NULL);
  80 }
  81
  82 #else
  83
  84 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
  85
  86 /*@{*/
  87 /*!
  88  * blk0() and blk() perform the initial expand.
  89  * I got the idea of expanding during the round function from SSLeay
  90  */
  91 #if !defined(WORDS_BIGENDIAN)
  92 # define blk0(i) \
  93         (block->l[i] = (rol(block->l[i], 24) & 0xFF00FF00) \
  94          | (rol(block->l[i], 8) & 0x00FF00FF))
  95 #else
  96 # define blk0(i) block->l[i]
  97 #endif
  98 #define blk(i) \
  99         (block->l[i & 15] = rol(block->l[(i + 13) & 15] \
 100                                 ^ block->l[(i + 8) & 15] \
 101                                 ^ block->l[(i + 2) & 15] \
 102                                 ^ block->l[i & 15], 1))
 103
 104 /*@}*/
 105 /*@{*/
 106 /*!
 107  * (R0+R1), R2, R3, R4 are the different operations (rounds) used in SHA1
 108  */
 109 #define R0(v,w,x,y,z,i) \
 110         z += ((w & (x ^ y)) ^ y) + blk0(i) + 0x5A827999 + rol(v, 5); \
 111         w = rol(w, 30);
 112 #define R1(v,w,x,y,z,i) \
 113         z += ((w & (x ^ y)) ^ y) + blk(i) + 0x5A827999 + rol(v, 5); \
 114         w = rol(w, 30);
 115 #define R2(v,w,x,y,z,i) \
 116         z += (w ^ x ^ y) + blk(i) + 0x6ED9EBA1 + rol(v, 5); \
 117         w = rol(w, 30);
 118 #define R3(v,w,x,y,z,i) \
 119         z += (((w | x) & y) | (w & x)) + blk(i) + 0x8F1BBCDC + rol(v, 5); \
 120         w = rol(w, 30);
 121 #define R4(v,w,x,y,z,i) \
 122         z += (w ^ x ^ y) + blk(i) + 0xCA62C1D6 + rol(v, 5); \
 123         w = rol(w, 30);
 124
 125 /*@}*/
 126
 127 typedef union {
 128         unsigned char c[64];
 129         unsigned int l[16];
 130 } CHAR64LONG16;
 131
 132 #ifdef __sparc_v9__
 133 static void do_R01(isc_uint32_t *a, isc_uint32_t *b, isc_uint32_t *c,
 134                    isc_uint32_t *d, isc_uint32_t *e, CHAR64LONG16 *);
 135 static void do_R2(isc_uint32_t *a, isc_uint32_t *b, isc_uint32_t *c,
 136                   isc_uint32_t *d, isc_uint32_t *e, CHAR64LONG16 *);
 137 static void do_R3(isc_uint32_t *a, isc_uint32_t *b, isc_uint32_t *c,
 138                   isc_uint32_t *d, isc_uint32_t *e, CHAR64LONG16 *);
 139 static void do_R4(isc_uint32_t *a, isc_uint32_t *b, isc_uint32_t *c,
 140                   isc_uint32_t *d, isc_uint32_t *e, CHAR64LONG16 *);
 141
 142 #define nR0(v,w,x,y,z,i) R0(*v,*w,*x,*y,*z,i)
 143 #define nR1(v,w,x,y,z,i) R1(*v,*w,*x,*y,*z,i)
 144 #define nR2(v,w,x,y,z,i) R2(*v,*w,*x,*y,*z,i)
 145 #define nR3(v,w,x,y,z,i) R3(*v,*w,*x,*y,*z,i)
 146 #define nR4(v,w,x,y,z,i) R4(*v,*w,*x,*y,*z,i)
 147
 148 static void
 149 do_R01(isc_uint32_t *a, isc_uint32_t *b, isc_uint32_t *c, isc_uint32_t *d,
 150        isc_uint32_t *e, CHAR64LONG16 *block)
 151 {
 152         nR0(a,b,c,d,e, 0); nR0(e,a,b,c,d, 1); nR0(d,e,a,b,c, 2);
 153         nR0(c,d,e,a,b, 3); nR0(b,c,d,e,a, 4); nR0(a,b,c,d,e, 5);
 154         nR0(e,a,b,c,d, 6); nR0(d,e,a,b,c, 7); nR0(c,d,e,a,b, 8);
 155         nR0(b,c,d,e,a, 9); nR0(a,b,c,d,e,10); nR0(e,a,b,c,d,11);
 156         nR0(d,e,a,b,c,12); nR0(c,d,e,a,b,13); nR0(b,c,d,e,a,14);
 157         nR0(a,b,c,d,e,15); nR1(e,a,b,c,d,16); nR1(d,e,a,b,c,17);
 158         nR1(c,d,e,a,b,18); nR1(b,c,d,e,a,19);
 159 }
 160
 161 static void
 162 do_R2(isc_uint32_t *a, isc_uint32_t *b, isc_uint32_t *c, isc_uint32_t *d,
 163       isc_uint32_t *e, CHAR64LONG16 *block)
 164 {
 165         nR2(a,b,c,d,e,20); nR2(e,a,b,c,d,21); nR2(d,e,a,b,c,22);
 166         nR2(c,d,e,a,b,23); nR2(b,c,d,e,a,24); nR2(a,b,c,d,e,25);
 167         nR2(e,a,b,c,d,26); nR2(d,e,a,b,c,27); nR2(c,d,e,a,b,28);
 168         nR2(b,c,d,e,a,29); nR2(a,b,c,d,e,30); nR2(e,a,b,c,d,31);
 169         nR2(d,e,a,b,c,32); nR2(c,d,e,a,b,33); nR2(b,c,d,e,a,34);
 170         nR2(a,b,c,d,e,35); nR2(e,a,b,c,d,36); nR2(d,e,a,b,c,37);
 171         nR2(c,d,e,a,b,38); nR2(b,c,d,e,a,39);
 172 }
 173
 174 static void
 175 do_R3(isc_uint32_t *a, isc_uint32_t *b, isc_uint32_t *c, isc_uint32_t *d,
 176       isc_uint32_t *e, CHAR64LONG16 *block)
 177 {
 178         nR3(a,b,c,d,e,40); nR3(e,a,b,c,d,41); nR3(d,e,a,b,c,42);
 179         nR3(c,d,e,a,b,43); nR3(b,c,d,e,a,44); nR3(a,b,c,d,e,45);
 180         nR3(e,a,b,c,d,46); nR3(d,e,a,b,c,47); nR3(c,d,e,a,b,48);
 181         nR3(b,c,d,e,a,49); nR3(a,b,c,d,e,50); nR3(e,a,b,c,d,51);
 182         nR3(d,e,a,b,c,52); nR3(c,d,e,a,b,53); nR3(b,c,d,e,a,54);
 183         nR3(a,b,c,d,e,55); nR3(e,a,b,c,d,56); nR3(d,e,a,b,c,57);
 184         nR3(c,d,e,a,b,58); nR3(b,c,d,e,a,59);
 185 }
 186
 187 static void
 188 do_R4(isc_uint32_t *a, isc_uint32_t *b, isc_uint32_t *c, isc_uint32_t *d,
 189       isc_uint32_t *e, CHAR64LONG16 *block)
 190 {
 191         nR4(a,b,c,d,e,60); nR4(e,a,b,c,d,61); nR4(d,e,a,b,c,62);
 192         nR4(c,d,e,a,b,63); nR4(b,c,d,e,a,64); nR4(a,b,c,d,e,65);
 193         nR4(e,a,b,c,d,66); nR4(d,e,a,b,c,67); nR4(c,d,e,a,b,68);
 194         nR4(b,c,d,e,a,69); nR4(a,b,c,d,e,70); nR4(e,a,b,c,d,71);
 195         nR4(d,e,a,b,c,72); nR4(c,d,e,a,b,73); nR4(b,c,d,e,a,74);
 196         nR4(a,b,c,d,e,75); nR4(e,a,b,c,d,76); nR4(d,e,a,b,c,77);
 197         nR4(c,d,e,a,b,78); nR4(b,c,d,e,a,79);
 198 }
 199 #endif
 200
 201 /*!
 202  * Hash a single 512-bit block. This is the core of the algorithm.
 203  */
 204 static void
 205 transform(isc_uint32_t state[5], const unsigned char buffer[64]) {
 206         isc_uint32_t a, b, c, d, e;
 207         CHAR64LONG16 *block;
 208         CHAR64LONG16 workspace;
 209
 210         INSIST(buffer != NULL);
 211         INSIST(state != NULL);
 212
 213         block = &workspace;
 214         (void)memcpy(block, buffer, 64);
 215
 216         /* Copy context->state[] to working vars */
 217         a = state[0];
 218         b = state[1];
 219         c = state[2];
 220         d = state[3];
 221         e = state[4];
 222
 223 #ifdef __sparc_v9__
 224         do_R01(&a, &b, &c, &d, &e, block);
 225         do_R2(&a, &b, &c, &d, &e, block);
 226         do_R3(&a, &b, &c, &d, &e, block);
 227         do_R4(&a, &b, &c, &d, &e, block);
 228 #else
 229         /* 4 rounds of 20 operations each. Loop unrolled. */
 230         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);
 231         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);
 232         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);
 233         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);
 234         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);
 235         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);
 236         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);
 237         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);
 238         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);
 239         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);
 240         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);
 241         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);
 242         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);
 243         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);
 244         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);
 245         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);
 246         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);
 247         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);
 248         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);
 249         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);
 250 #endif
 251
 252         /* Add the working vars back into context.state[] */
 253         state[0] += a;
 254         state[1] += b;
 255         state[2] += c;
 256         state[3] += d;
 257         state[4] += e;
 258
 259         /* Wipe variables */
 260         a = b = c = d = e = 0;
 261 }
 262
 263
 264 /*!
 265  * isc_sha1_init - Initialize new context
 266  */
 267 void
 268 isc_sha1_init(isc_sha1_t *context)
 269 {
 270         INSIST(context != NULL);
 271
 272         /* SHA1 initialization constants */
 273         context->state[0] = 0x67452301;
 274         context->state[1] = 0xEFCDAB89;
 275         context->state[2] = 0x98BADCFE;
 276         context->state[3] = 0x10325476;
 277         context->state[4] = 0xC3D2E1F0;
 278         context->count[0] = 0;
 279         context->count[1] = 0;
 280 }
 281
 282 void
 283 isc_sha1_invalidate(isc_sha1_t *context) {
 284         memset(context, 0, sizeof(isc_sha1_t));
 285 }
 286
 287 /*!
 288  * Run your data through this.
 289  */
 290 void
 291 isc_sha1_update(isc_sha1_t *context, const unsigned char *data,
 292                 unsigned int len)
 293 {
 294         unsigned int i, j;
 295
 296         INSIST(context != 0);
 297         INSIST(data != 0);
 298
 299         j = context->count[0];
 300         if ((context->count[0] += len << 3) < j)
 301                 context->count[1] += (len >> 29) + 1;
 302         j = (j >> 3) & 63;
 303         if ((j + len) > 63) {
 304                 (void)memcpy(&context->buffer[j], data, (i = 64 - j));
 305                 transform(context->state, context->buffer);
 306                 for (; i + 63 < len; i += 64)
 307                         transform(context->state, &data[i]);
 308                 j = 0;
 309         } else {
 310                 i = 0;
 311         }
 312
 313         (void)memcpy(&context->buffer[j], &data[i], len - i);
 314 }
 315
 316
 317 /*!
 318  * Add padding and return the message digest.
 319  */
 320
 321 static const unsigned char final_200 = 128;
 322 static const unsigned char final_0 = 0;
 323
 324 void
 325 isc_sha1_final(isc_sha1_t *context, unsigned char *digest) {
 326         unsigned int i;
 327         unsigned char finalcount[8];
 328
 329         INSIST(digest != 0);
 330         INSIST(context != 0);
 331
 332         for (i = 0; i < 8; i++) {
 333                 /* Endian independent */
 334                 finalcount[i] = (unsigned char)
 335                         ((context->count[(i >= 4 ? 0 : 1)]
 336                           >> ((3 - (i & 3)) * 8)) & 255);
 337         }
 338
 339         isc_sha1_update(context, &final_200, 1);
 340         while ((context->count[0] & 504) != 448)
 341                 isc_sha1_update(context, &final_0, 1);
 342         /* The next Update should cause a transform() */
 343         isc_sha1_update(context, finalcount, 8);
 344
 345         if (digest) {
 346                 for (i = 0; i < 20; i++)
 347                         digest[i] = (unsigned char)
 348                                 ((context->state[i >> 2]
 349                                   >> ((3 - (i & 3)) * 8)) & 255);
 350         }
 351
 352         memset(context, 0, sizeof(isc_sha1_t));
 353 }
 354 #endif