Drizzled Public API Documentation

sha1.cc
Go to the documentation of this file.
00001 /*
00002  * Copyright (C) 2010 nobody (this is public domain)
00003  */
00004 
00010 /*
00011  * SHA-1 in C
00012  * 
00013  * This file is based on public domain code.
00014  * Initial source code is in the public domain, 
00015  * so clarified by Steve Reid <steve@edmweb.com>
00016  *
00017  * Test Vectors (from FIPS PUB 180-1)
00018  * "abc"
00019  *   A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
00020  * "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
00021  *   84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
00022  * A million repetitions of "a"
00023  *   34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
00024  */
00025 
00026 #include <config.h>
00027 #include "sha1.h"
00028 #include <string.h>
00029 
00030 namespace drizzled
00031 {
00032 
00033 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
00034 
00035 /* Solaris + gcc don't always define this. */
00036 #ifndef BYTE_ORDER
00037 # define LITTLE_ENDIAN 1234
00038 # define BIG_ENDIAN 4321
00039 # if defined(sparc) || defined(__sparc) || defined(__sparc__)
00040 #  define BYTE_ORDER BIG_ENDIAN
00041 # else
00042 #  define BYTE_ORDER LITTLE_ENDIAN
00043 # endif
00044 #endif /* BYTE_ORDER */
00045 
00046 /*
00047  * blk0() and blk() perform the initial expand.
00048  * I got the idea of expanding during the round function from SSLeay
00049  */
00050 #if BYTE_ORDER == LITTLE_ENDIAN
00051 # define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
00052     |(rol(block->l[i],8)&0x00FF00FF))
00053 #else
00054 # define blk0(i) block->l[i]
00055 #endif
00056 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
00057     ^block->l[(i+2)&15]^block->l[i&15],1))
00058 
00059 /*
00060  * (R0+R1), R2, R3, R4 are the different operations (rounds) used in SHA1
00061  */
00062 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
00063 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
00064 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
00065 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
00066 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
00067 
00068 /*
00069  * Hash a single 512-bit block. This is the core of the algorithm.
00070  */
00071 void
00072 SHA1Transform(uint32_t state[5], const uint8_t buffer[SHA1_BLOCK_LENGTH])
00073 {
00074   uint32_t a, b, c, d, e;
00075   typedef union {
00076     uint8_t c[64];
00077     uint32_t l[16];
00078   } CHAR64LONG16;
00079   CHAR64LONG16 realBlock;
00080   CHAR64LONG16 *block= &realBlock;
00081 
00082   (void)memcpy(block, buffer, SHA1_BLOCK_LENGTH);
00083 
00084   /* Copy context->state[] to working vars */
00085   a = state[0];
00086   b = state[1];
00087   c = state[2];
00088   d = state[3];
00089   e = state[4];
00090 
00091   /* 4 rounds of 20 operations each. Loop unrolled. */
00092   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);
00093   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);
00094   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);
00095   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);
00096   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);
00097   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);
00098   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);
00099   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);
00100   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);
00101   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);
00102   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);
00103   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);
00104   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);
00105   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);
00106   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);
00107   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);
00108   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);
00109   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);
00110   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);
00111   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);
00112 
00113   /* Add the working vars back into context.state[] */
00114   state[0] += a;
00115   state[1] += b;
00116   state[2] += c;
00117   state[3] += d;
00118   state[4] += e;
00119 
00120   /* Wipe variables */
00121   a = b = c = d = e = 0;
00122 }
00123 
00124 
00125 /*
00126  * SHA1Init - Initialize new context
00127  */
00128 void
00129 SHA1Init(SHA1_CTX *context)
00130 {
00131 
00132   /* SHA1 initialization constants */
00133   context->count = 0;
00134   context->state[0] = 0x67452301;
00135   context->state[1] = 0xEFCDAB89;
00136   context->state[2] = 0x98BADCFE;
00137   context->state[3] = 0x10325476;
00138   context->state[4] = 0xC3D2E1F0;
00139 }
00140 
00141 
00142 /*
00143  * Run your data through this.
00144  */
00145 void
00146 SHA1Update(SHA1_CTX *context, const uint8_t *data, size_t len)
00147 {
00148   size_t i, j;
00149 
00150   j = (size_t)((context->count >> 3) & 63);
00151   context->count += (len << 3);
00152   if ((j + len) > 63) {
00153     (void)memcpy(&context->buffer[j], data, (i = 64-j));
00154     SHA1Transform(context->state, context->buffer);
00155     for ( ; i + 63 < len; i += 64)
00156       SHA1Transform(context->state, (uint8_t *)&data[i]);
00157     j = 0;
00158   } else {
00159     i = 0;
00160   }
00161   (void)memcpy(&context->buffer[j], &data[i], len - i);
00162 }
00163 
00164 
00165 /*
00166  * Add padding and return the message digest.
00167  */
00168 void
00169 SHA1Pad(SHA1_CTX *context)
00170 {
00171   uint8_t finalcount[8];
00172   u_int i;
00173 
00174   for (i = 0; i < 8; i++) {
00175     finalcount[i] = (uint8_t)((context->count >>
00176         ((7 - (i & 7)) * 8)) & 255);  /* Endian independent */
00177   }
00178   SHA1Update(context, (uint8_t *)"\200", 1);
00179   while ((context->count & 504) != 448)
00180     SHA1Update(context, (uint8_t *)"\0", 1);
00181   SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */
00182 }
00183 
00184 void
00185 SHA1Final(uint8_t digest[SHA1_DIGEST_LENGTH], SHA1_CTX *context)
00186 {
00187   u_int i;
00188 
00189   SHA1Pad(context);
00190   if (digest) {
00191     for (i = 0; i < SHA1_DIGEST_LENGTH; i++) {
00192       digest[i] = (uint8_t)
00193          ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
00194     }
00195     memset(context, 0, sizeof(*context));
00196   }
00197 }
00198 
00199 } /* namespace drizzled */