"Fossies" - the Fresh Open Source Software Archive

Member "mod_auth_ldap/sha1.c" (15 Apr 2000, 6832 Bytes) of package /linux/www/apache_httpd_modules/old/mod_auth_ldap-0.5.1.tar.gz:


As a special service "Fossies" has tried to format the requested source page into HTML format using (guessed) C and C++ source code syntax highlighting (style: standard) with prefixed line numbers and code folding option. Alternatively you can here view or download the uninterpreted source code file.

    1 /*
    2 SHA-1 in C
    3 By Steve Reid <steve@edmweb.com>
    4 100% Public Domain
    5 
    6 slightly adopted for use in mod_auth_ldap 19990604 alex mayrhofer
    7 */
    8 
    9 #include "config.h"
   10 
   11 #ifndef WORDS_BIGENDIAN
   12 # define LITTLE_ENDIAN
   13 #endif
   14 
   15 
   16 #define SHA1HANDSOFF /* Copies data before messing with it. */
   17 #include <stdio.h>
   18 #include <string.h>
   19 
   20 typedef struct {
   21     unsigned long state[5];
   22     unsigned long count[2];
   23     unsigned char buffer[64];
   24 } SHA1_CTX;
   25 
   26 void SHA1Transform(unsigned long state[5], unsigned char buffer[64]);
   27 void SHA1Init(SHA1_CTX* context);
   28 void SHA1Update(SHA1_CTX* context, unsigned char* data, unsigned int len);
   29 void SHA1Final(unsigned char digest[20], SHA1_CTX* context);
   30 
   31 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
   32 
   33 /* blk0() and blk() perform the initial expand. */
   34 /* I got the idea of expanding during the round function from SSLeay */
   35 #ifdef LITTLE_ENDIAN
   36 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
   37     |(rol(block->l[i],8)&0x00FF00FF))
   38 #else
   39 #define blk0(i) block->l[i]
   40 #endif
   41 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
   42     ^block->l[(i+2)&15]^block->l[i&15],1))
   43 
   44 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
   45 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
   46 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
   47 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
   48 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
   49 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
   50 
   51 
   52 /* Hash a single 512-bit block. This is the core of the algorithm. */
   53 
   54 void SHA1Transform(unsigned long state[5], unsigned char buffer[64])
   55 {
   56 unsigned long a, b, c, d, e;
   57 typedef union {
   58     unsigned char c[64];
   59     unsigned long l[16];
   60 } CHAR64LONG16;
   61 CHAR64LONG16* block;
   62 #ifdef SHA1HANDSOFF
   63 static unsigned char workspace[64];
   64     block = (CHAR64LONG16*)workspace;
   65     memcpy(block, buffer, 64);
   66 #else
   67     block = (CHAR64LONG16*)buffer;
   68 #endif
   69     /* Copy context->state[] to working vars */
   70     a = state[0];
   71     b = state[1];
   72     c = state[2];
   73     d = state[3];
   74     e = state[4];
   75     /* 4 rounds of 20 operations each. Loop unrolled. */
   76     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);
   77     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);
   78     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);
   79     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);
   80     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);
   81     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);
   82     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);
   83     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);
   84     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);
   85     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);
   86     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);
   87     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);
   88     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);
   89     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);
   90     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);
   91     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);
   92     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);
   93     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);
   94     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);
   95     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);
   96     /* Add the working vars back into context.state[] */
   97     state[0] += a;
   98     state[1] += b;
   99     state[2] += c;
  100     state[3] += d;
  101     state[4] += e;
  102     /* Wipe variables */
  103     a = b = c = d = e = 0;
  104 }
  105 
  106 
  107 /* SHA1Init - Initialize new context */
  108 
  109 void SHA1Init(SHA1_CTX* context)
  110 {
  111     /* SHA1 initialization constants */
  112     context->state[0] = 0x67452301;
  113     context->state[1] = 0xEFCDAB89;
  114     context->state[2] = 0x98BADCFE;
  115     context->state[3] = 0x10325476;
  116     context->state[4] = 0xC3D2E1F0;
  117     context->count[0] = context->count[1] = 0;
  118 }
  119 
  120 
  121 /* Run your data through this. */
  122 
  123 void SHA1Update(SHA1_CTX* context, unsigned char* data, unsigned int len)
  124 {
  125 unsigned int i, j;
  126 
  127     j = (context->count[0] >> 3) & 63;
  128     if ((context->count[0] += len << 3) < (len << 3)) context->count[1]++;
  129     context->count[1] += (len >> 29);
  130     if ((j + len) > 63) {
  131         memcpy(&context->buffer[j], data, (i = 64-j));
  132         SHA1Transform(context->state, context->buffer);
  133         for ( ; i + 63 < len; i += 64) {
  134             SHA1Transform(context->state, &data[i]);
  135         }
  136         j = 0;
  137     }
  138     else i = 0;
  139     memcpy(&context->buffer[j], &data[i], len - i);
  140 }
  141 
  142 
  143 /* Add padding and return the message digest. */
  144 
  145 void SHA1Final(unsigned char digest[20], SHA1_CTX* context)
  146 {
  147 unsigned long i, j;
  148 unsigned char finalcount[8];
  149 
  150     for (i = 0; i < 8; i++) {
  151         finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
  152          >> ((3-(i & 3)) * 8) ) & 255);  /* Endian independent */
  153     }
  154     SHA1Update(context, (unsigned char *)"\200", 1);
  155     while ((context->count[0] & 504) != 448) {
  156         SHA1Update(context, (unsigned char *)"\0", 1);
  157     }
  158     SHA1Update(context, finalcount, 8);  /* Should cause a SHA1Transform() */
  159     for (i = 0; i < 20; i++) {
  160         digest[i] = (unsigned char)
  161          ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
  162     }
  163     /* Wipe variables */
  164     i = j = 0;
  165     memset(context->buffer, 0, 64);
  166     memset(context->state, 0, 20);
  167     memset(context->count, 0, 8);
  168     memset(&finalcount, 0, 8);
  169 #ifdef SHA1HANDSOFF  /* make SHA1Transform overwrite it's own static vars */
  170     SHA1Transform(context->state, context->buffer);
  171 #endif
  172 }
  173 
  174 
  175 /*************************************************************/
  176 
  177 static char basis_64[] =
  178 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
  179 
  180 void sha1_digest(char *message, unsigned int msglen, char *digest)
  181 {
  182 int i;
  183 SHA1_CTX context;
  184 unsigned char bin_digest[21];
  185 char encodedDigest[30];
  186 char *p;
  187 
  188 memset(bin_digest, 0, 21);
  189 SHA1Init(&context);
  190 SHA1Update(&context, message, msglen);
  191 SHA1Final(bin_digest, &context);
  192 
  193 p = encodedDigest;
  194 for (i = 0; i < sizeof(bin_digest); i += 3) {
  195    *p++ = basis_64[bin_digest[i] >> 2];
  196    *p++ = basis_64[((bin_digest[i] & 0x3) << 4) | ((int) (bin_digest[i + 1] & 0xF0) >> 4)];
  197    *p++ = basis_64[((bin_digest[i + 1] & 0xF) << 2) | ((int) (bin_digest[i + 2] & 0xC0) >> 6)];
  198    *p++ = basis_64[bin_digest[i + 2] & 0x3F];
  199    }
  200 *p-- = '\0';
  201 *p-- = '=';
  202 strcpy(digest, encodedDigest);
  203 }