apt-pkg/contrib/sha1.cc

   1 // -*- mode: cpp; mode: fold -*-
   2 // Description                                                          /*{{{*/
   3 // $Id: sha1.cc,v 1.3 2001/05/13 05:15:03 jgg Exp $
   4 /* ######################################################################
   5
   6    SHA1 - SHA-1 Secure Hash Algorithm.
   7
   8    This file is a Public Domain wrapper for the Public Domain SHA1
   9    calculation code that is at it's end.
  10
  11    The algorithm was originally implemented by
  12    Steve Reid <sreid@sea-to-sky.net> and later modified by
  13    James H. Brown <jbrown@burgoyne.com>.
  14
  15    Modifications for APT were done by Alfredo K. Kojima and Jason
  16    Gunthorpe.
  17
  18    Still in the public domain.
  19
  20    Test Vectors (from FIPS PUB 180-1)
  21    "abc"
  22    A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
  23    "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
  24    84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
  25    A million repetitions of "a"
  26    34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
  27
  28    #####################################################################
  29  */
  30                                                                         /*}}} */
  31 // Include Files                                                        /*{{{*/
  32 #include <apt-pkg/sha1.h>
  33 #include <apt-pkg/strutl.h>
  34 #include <apt-pkg/macros.h>
  35
  36 #include <string.h>
  37 #include <unistd.h>
  38 #include <inttypes.h>
  39 #include <config.h>
  40                                                                         /*}}}*/
  41
  42 // SHA1Transform - Alters an existing SHA-1 hash                        /*{{{*/
  43 // ---------------------------------------------------------------------
  44 /* The core of the SHA-1 algorithm. This alters an existing SHA-1 hash to
  45    reflect the addition of 16 longwords of new data. Other routines convert
  46    incoming stream data into 16 long word chunks for this routine */
  47
  48 #define rol(value,bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
  49
  50 /* blk0() and blk() perform the initial expand. */
  51 /* I got the idea of expanding during the round function from SSLeay */
  52 #ifndef WORDS_BIGENDIAN
  53 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
  54     |(rol(block->l[i],8)&0x00FF00FF))
  55 #else
  56 #define blk0(i) block->l[i]
  57 #endif
  58 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
  59     ^block->l[(i+2)&15]^block->l[i&15],1))
  60
  61 /* (R0+R1),R2,R3,R4 are the different operations used in SHA1 */
  62 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
  63 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
  64 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
  65 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
  66 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
  67
  68 static void SHA1Transform(uint32_t state[5],uint8_t const buffer[64])
  69 {
  70    uint32_t a,b,c,d,e;
  71    typedef union
  72    {
  73       uint8_t c[64];
  74       uint32_t l[16];
  75    }
  76    CHAR64LONG16;
  77    CHAR64LONG16 *block;
  78
  79    uint8_t workspace[64];
  80    block = (CHAR64LONG16 *)workspace;
  81    memcpy(block,buffer,sizeof(workspace));
  82
  83    /* Copy context->state[] to working vars */
  84    a = state[0];
  85    b = state[1];
  86    c = state[2];
  87    d = state[3];
  88    e = state[4];
  89
  90    /* 4 rounds of 20 operations each. Loop unrolled. */
  91    R0(a,b,c,d,e,0);
  92    R0(e,a,b,c,d,1);
  93    R0(d,e,a,b,c,2);
  94    R0(c,d,e,a,b,3);
  95    R0(b,c,d,e,a,4);
  96    R0(a,b,c,d,e,5);
  97    R0(e,a,b,c,d,6);
  98    R0(d,e,a,b,c,7);
  99    R0(c,d,e,a,b,8);
 100    R0(b,c,d,e,a,9);
 101    R0(a,b,c,d,e,10);
 102    R0(e,a,b,c,d,11);
 103    R0(d,e,a,b,c,12);
 104    R0(c,d,e,a,b,13);
 105    R0(b,c,d,e,a,14);
 106    R0(a,b,c,d,e,15);
 107    R1(e,a,b,c,d,16);
 108    R1(d,e,a,b,c,17);
 109    R1(c,d,e,a,b,18);
 110    R1(b,c,d,e,a,19);
 111    R2(a,b,c,d,e,20);
 112    R2(e,a,b,c,d,21);
 113    R2(d,e,a,b,c,22);
 114    R2(c,d,e,a,b,23);
 115    R2(b,c,d,e,a,24);
 116    R2(a,b,c,d,e,25);
 117    R2(e,a,b,c,d,26);
 118    R2(d,e,a,b,c,27);
 119    R2(c,d,e,a,b,28);
 120    R2(b,c,d,e,a,29);
 121    R2(a,b,c,d,e,30);
 122    R2(e,a,b,c,d,31);
 123    R2(d,e,a,b,c,32);
 124    R2(c,d,e,a,b,33);
 125    R2(b,c,d,e,a,34);
 126    R2(a,b,c,d,e,35);
 127    R2(e,a,b,c,d,36);
 128    R2(d,e,a,b,c,37);
 129    R2(c,d,e,a,b,38);
 130    R2(b,c,d,e,a,39);
 131    R3(a,b,c,d,e,40);
 132    R3(e,a,b,c,d,41);
 133    R3(d,e,a,b,c,42);
 134    R3(c,d,e,a,b,43);
 135    R3(b,c,d,e,a,44);
 136    R3(a,b,c,d,e,45);
 137    R3(e,a,b,c,d,46);
 138    R3(d,e,a,b,c,47);
 139    R3(c,d,e,a,b,48);
 140    R3(b,c,d,e,a,49);
 141    R3(a,b,c,d,e,50);
 142    R3(e,a,b,c,d,51);
 143    R3(d,e,a,b,c,52);
 144    R3(c,d,e,a,b,53);
 145    R3(b,c,d,e,a,54);
 146    R3(a,b,c,d,e,55);
 147    R3(e,a,b,c,d,56);
 148    R3(d,e,a,b,c,57);
 149    R3(c,d,e,a,b,58);
 150    R3(b,c,d,e,a,59);
 151    R4(a,b,c,d,e,60);
 152    R4(e,a,b,c,d,61);
 153    R4(d,e,a,b,c,62);
 154    R4(c,d,e,a,b,63);
 155    R4(b,c,d,e,a,64);
 156    R4(a,b,c,d,e,65);
 157    R4(e,a,b,c,d,66);
 158    R4(d,e,a,b,c,67);
 159    R4(c,d,e,a,b,68);
 160    R4(b,c,d,e,a,69);
 161    R4(a,b,c,d,e,70);
 162    R4(e,a,b,c,d,71);
 163    R4(d,e,a,b,c,72);
 164    R4(c,d,e,a,b,73);
 165    R4(b,c,d,e,a,74);
 166    R4(a,b,c,d,e,75);
 167    R4(e,a,b,c,d,76);
 168    R4(d,e,a,b,c,77);
 169    R4(c,d,e,a,b,78);
 170    R4(b,c,d,e,a,79);
 171
 172    /* Add the working vars back into context.state[] */
 173    state[0] += a;
 174    state[1] += b;
 175    state[2] += c;
 176    state[3] += d;
 177    state[4] += e;
 178 }
 179                                                                         /*}}}*/
 180
 181 // SHA1Summation::SHA1Summation - Constructor                           /*{{{*/
 182 // ---------------------------------------------------------------------
 183 /* */
 184 SHA1Summation::SHA1Summation()
 185 {
 186    uint32_t *state = (uint32_t *)State;
 187    uint32_t *count = (uint32_t *)Count;
 188
 189    /* SHA1 initialization constants */
 190    state[0] = 0x67452301;
 191    state[1] = 0xEFCDAB89;
 192    state[2] = 0x98BADCFE;
 193    state[3] = 0x10325476;
 194    state[4] = 0xC3D2E1F0;
 195    count[0] = 0;
 196    count[1] = 0;
 197    Done = false;
 198 }
 199                                                                         /*}}}*/
 200 // SHA1Summation::Result - Return checksum value                        /*{{{*/
 201 // ---------------------------------------------------------------------
 202 /* Add() may not be called after this */
 203 SHA1SumValue SHA1Summation::Result()
 204 {
 205    uint32_t *state = (uint32_t *)State;
 206    uint32_t *count = (uint32_t *)Count;
 207
 208    // Apply the padding
 209    if (Done == false)
 210    {
 211       unsigned char finalcount[8];
 212
 213       for (unsigned i = 0; i < 8; i++)
 214       {
 215          // Endian independent
 216          finalcount[i] = (unsigned char) ((count[(i >= 4 ? 0 : 1)]
 217                                            >> ((3 - (i & 3)) * 8)) & 255);
 218       }
 219
 220       Add((unsigned char *) "\200",1);
 221       while ((count[0] & 504) != 448)
 222          Add((unsigned char *) "\0",1);
 223
 224       Add(finalcount,8);        /* Should cause a SHA1Transform() */
 225
 226    }
 227
 228    Done = true;
 229
 230    // Transfer over the result
 231    SHA1SumValue Value;
 232    char res[20];
 233    for (unsigned i = 0; i < 20; i++)
 234    {
 235       res[i] = (unsigned char)
 236          ((state[i >> 2] >> ((3 - (i & 3)) * 8)) & 255);
 237    }
 238    Value.Set(res);
 239    return Value;
 240 }
 241                                                                         /*}}}*/
 242 // SHA1Summation::Add - Adds content of buffer into the checksum        /*{{{*/
 243 // ---------------------------------------------------------------------
 244 /* May not be called after Result() is called */
 245 bool SHA1Summation::Add(const unsigned char *data,unsigned long len)
 246 {
 247    if (Done)
 248       return false;
 249
 250    uint32_t *state = (uint32_t *)State;
 251    uint32_t *count = (uint32_t *)Count;
 252    uint8_t *buffer = (uint8_t *)Buffer;
 253    uint32_t i,j;
 254
 255    j = (count[0] >> 3) & 63;
 256    if ((count[0] += len << 3) < (len << 3))
 257       count[1]++;
 258    count[1] += (len >> 29);
 259    if ((j + len) > 63)
 260    {
 261       memcpy(&buffer[j],data,(i = 64 - j));
 262       SHA1Transform(state,buffer);
 263       for (; i + 63 < len; i += 64)
 264       {
 265          SHA1Transform(state,&data[i]);
 266       }
 267       j = 0;
 268    }
 269    else
 270       i = 0;
 271    memcpy(&buffer[j],&data[i],len - i);
 272
 273    return true;
 274 }
 275                                                                         /*}}}*/
 276 // SHA1Summation::AddFD - Add content of file into the checksum         /*{{{*/
 277 // ---------------------------------------------------------------------
 278 /* */
 279 bool SHA1Summation::AddFD(int Fd,unsigned long Size)
 280 {
 281    unsigned char Buf[64 * 64];
 282    int Res = 0;
 283    int ToEOF = (Size == 0);
 284    while (Size != 0 || ToEOF)
 285    {
 286       unsigned n = sizeof(Buf);
 287       if (!ToEOF) n = min(Size,(unsigned long)n);
 288       Res = read(Fd,Buf,n);
 289       if (Res < 0 || (!ToEOF && (unsigned) Res != n)) // error, or short read
 290          return false;
 291       if (ToEOF && Res == 0) // EOF
 292          break;
 293       Size -= Res;
 294       Add(Buf,Res);
 295    }
 296    return true;
 297 }
 298                                                                         /*}}}*/