bsd/dev/random/YarrowCoreLib/src/sha1mod.c

   1 /*
   2  * Copyright (c) 2006 Apple Computer, Inc. All Rights Reserved.
   3  *
   4  * @APPLE_LICENSE_OSREFERENCE_HEADER_START@
   5  *
   6  * This file contains Original Code and/or Modifications of Original Code
   7  * as defined in and that are subject to the Apple Public Source License
   8  * Version 2.0 (the 'License'). You may not use this file except in
   9  * compliance with the License.  The rights granted to you under the
  10  * License may not be used to create, or enable the creation or
  11  * redistribution of, unlawful or unlicensed copies of an Apple operating
  12  * system, or to circumvent, violate, or enable the circumvention or
  13  * violation of, any terms of an Apple operating system software license
  14  * agreement.
  15  *
  16  * Please obtain a copy of the License at
  17  * http://www.opensource.apple.com/apsl/ and read it before using this
  18  * file.
  19  *
  20  * The Original Code and all software distributed under the License are
  21  * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
  22  * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
  23  * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
  24  * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
  25  * Please see the License for the specific language governing rights and
  26  * limitations under the License.
  27  *
  28  * @APPLE_LICENSE_OSREFERENCE_HEADER_END@
  29  */
  30
  31 /*
  32 SHA-1 in C
  33 By Steve Reid <steve@edmweb.com>
  34 100% Public Domain
  35 */
  36 /* Header portion split from main code for convenience (AYB 3/02/98) */
  37 #include "sha1mod.h"
  38 #ifdef SHA1HANDSOFF
  39 #include <string.h>
  40 #endif
  41
  42 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
  43
  44 /*
  45  * Apple change...
  46  */
  47 #if     defined(macintosh) || defined (__APPLE__)
  48 #undef LITTLE_ENDIAN
  49 #endif
  50
  51 /* blk0() and blk() perform the initial expand. */
  52 /* I got the idea of expanding during the round function from SSLeay */
  53 #ifdef LITTLE_ENDIAN
  54 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
  55     |(rol(block->l[i],8)&0x00FF00FF))
  56 #else
  57 #define blk0(i) block->l[i]
  58 #endif
  59 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
  60     ^block->l[(i+2)&15]^block->l[i&15],1))
  61
  62 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
  63 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
  64 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
  65 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
  66 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
  67 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
  68
  69
  70 /* Hash a single 512-bit block. This is the core of the algorithm. */
  71
  72 void SHA1Transform(unsigned long state[5], const unsigned char buffer[64])
  73 {
  74 unsigned long a, b, c, d, e;
  75 typedef union {
  76     unsigned char c[64];
  77     unsigned long l[16];
  78 } CHAR64LONG16;
  79 CHAR64LONG16* block;
  80 #ifdef SHA1HANDSOFF
  81 static unsigned char workspace[64];
  82     block = (CHAR64LONG16*)workspace;
  83     memcpy(block, buffer, 64);
  84 #else
  85     block = (CHAR64LONG16*)buffer;
  86 #endif
  87     /* Copy context->state[] to working vars */
  88     a = state[0];
  89     b = state[1];
  90     c = state[2];
  91     d = state[3];
  92     e = state[4];
  93     /* 4 rounds of 20 operations each. Loop unrolled. */
  94     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);
  95     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);
  96     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);
  97     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);
  98     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);
  99     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);
 100     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);
 101     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);
 102     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);
 103     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);
 104     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);
 105     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);
 106     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);
 107     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);
 108     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);
 109     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);
 110     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);
 111     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);
 112     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);
 113     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);
 114     /* Add the working vars back into context.state[] */
 115     state[0] += a;
 116     state[1] += b;
 117     state[2] += c;
 118     state[3] += d;
 119     state[4] += e;
 120     /* Wipe variables */
 121     a = b = c = d = e = 0;
 122 }
 123
 124
 125 /* SHA1Init - Initialize new context */
 126
 127 void SHA1Init(SHA1_CTX* context)
 128 {
 129     /* SHA1 initialization constants */
 130     context->state[0] = 0x67452301;
 131     context->state[1] = 0xEFCDAB89;
 132     context->state[2] = 0x98BADCFE;
 133     context->state[3] = 0x10325476;
 134     context->state[4] = 0xC3D2E1F0;
 135     context->count[0] = context->count[1] = 0;
 136 }
 137
 138
 139 /* Run your data through this. */
 140
 141 void SHA1Update(SHA1_CTX* context, const unsigned char* data, unsigned int len)
 142 {
 143 unsigned int i, j;
 144
 145     j = (context->count[0] >> 3) & 63;
 146     if ((context->count[0] += len << 3) < (len << 3)) context->count[1]++;
 147     context->count[1] += (len >> 29);
 148     if ((j + len) > 63) {
 149         memcpy(&context->buffer[j], data, (i = 64-j));
 150         SHA1Transform(context->state, context->buffer);
 151         for ( ; i + 63 < len; i += 64) {
 152             SHA1Transform(context->state, &data[i]);
 153         }
 154         j = 0;
 155     }
 156     else i = 0;
 157     memcpy(&context->buffer[j], &data[i], len - i);
 158 }
 159
 160
 161 /* Add padding and return the message digest. */
 162
 163 void SHA1Final(unsigned char digest[20], SHA1_CTX* context)
 164 {
 165 unsigned long i, j;
 166 unsigned char finalcount[8];
 167
 168     for (i = 0; i < 8; i++) {
 169         finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
 170          >> ((3-(i & 3)) * 8) ) & 255);  /* Endian independent */
 171     }
 172     SHA1Update(context, "\200", 1);
 173     while ((context->count[0] & 504) != 448) {
 174         SHA1Update(context, "\0", 1);
 175     }
 176     SHA1Update(context, finalcount, 8);  /* Should cause a SHA1Transform() */
 177     for (i = 0; i < 20; i++) {
 178         digest[i] = (unsigned char)
 179          ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
 180     }
 181     /* Wipe variables */
 182     i = j = 0;
 183     memset(context->buffer, 0, 64);
 184     memset(context->state, 0, 20);
 185     memset(context->count, 0, 8);
 186     memset(finalcount, 0, 8);
 187 #ifdef SHA1HANDSOFF  /* make SHA1Transform overwrite it's own static vars */
 188     SHA1Transform(context->state, context->buffer);
 189 #endif
 190 }
 191
 192
 193 /*************************************************************/
 194
 195 /* Test Code */
 196
 197 #if 0
 198
 199 int main(int argc, char** argv)
 200 {
 201 int i, j;
 202 SHA1_CTX context;
 203 unsigned char digest[20], buffer[16384];
 204 FILE* file;
 205
 206     if (argc > 2) {
 207         puts("Public domain SHA-1 implementation - by Steve Reid <steve@edmweb.com>");
 208         puts("Produces the SHA-1 hash of a file, or stdin if no file is specified.");
 209         exit(0);
 210     }
 211     if (argc < 2) {
 212         file = stdin;
 213     }
 214     else {
 215         if (!(file = fopen(argv[1], "rb"))) {
 216             fputs("Unable to open file.", stderr);
 217             exit(-1);
 218         }
 219     }
 220     SHA1Init(&context);
 221     while (!feof(file)) {  /* note: what if ferror(file) */
 222         i = fread(buffer, 1, 16384, file);
 223         SHA1Update(&context, buffer, i);
 224     }
 225     SHA1Final(digest, &context);
 226     fclose(file);
 227     for (i = 0; i < 5; i++) {
 228         for (j = 0; j < 4; j++) {
 229             printf("%02X", digest[i*4+j]);
 230         }
 231         putchar(' ');
 232     }
 233     putchar('\n');
 234     exit(0);
 235 }
 236
 237 #endif