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

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