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

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