Drizzled Public API Documentation

sha1.cc
Go to the documentation of this file.
1 
6 /*
7  * SHA-1 in C
8  *
9  * Copyright (C) 2010 nobody (this is public domain)
10  *
11  * This file is based on public domain code.
12  * Initial source code is in the public domain,
13  * so clarified by Steve Reid <steve@edmweb.com>
14  *
15  * Test Vectors (from FIPS PUB 180-1)
16  * "abc"
17  * A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
18  * "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
19  * 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
20  * A million repetitions of "a"
21  * 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
22  */
23 
24 #include <libdrizzle/common.h>
25 
26 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
27 
28 /*
29  * blk0() and blk() perform the initial expand.
30  * I got the idea of expanding during the round function from SSLeay
31  */
32 #ifndef WORDS_BIGENDIAN
33 # define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
34  |(rol(block->l[i],8)&0x00FF00FF))
35 #else
36 # define blk0(i) block->l[i]
37 #endif
38 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
39  ^block->l[(i+2)&15]^block->l[i&15],1))
40 
41 /*
42  * (R0+R1), R2, R3, R4 are the different operations (rounds) used in SHA1
43  */
44 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
45 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
46 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
47 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
48 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
49 
50 /*
51  * Hash a single 512-bit block. This is the core of the algorithm.
52  */
53 void
54 SHA1Transform(uint32_t state[5], const uint8_t buffer[SHA1_BLOCK_LENGTH])
55 {
56  uint32_t a, b, c, d, e;
57  typedef union {
58  uint8_t c[64];
59  uint32_t l[16];
60  } CHAR64LONG16;
61  CHAR64LONG16 realBlock;
62  CHAR64LONG16 *block= &realBlock;
63 
64  (void)memcpy(block, buffer, SHA1_BLOCK_LENGTH);
65 
66  /* Copy context->state[] to working vars */
67  a = state[0];
68  b = state[1];
69  c = state[2];
70  d = state[3];
71  e = state[4];
72 
73  /* 4 rounds of 20 operations each. Loop unrolled. */
74  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);
75  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);
76  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);
77  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);
78  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);
79  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);
80  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);
81  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);
82  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);
83  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);
84  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);
85  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);
86  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);
87  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);
88  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);
89  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);
90  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);
91  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);
92  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);
93  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);
94 
95  /* Add the working vars back into context.state[] */
96  state[0] += a;
97  state[1] += b;
98  state[2] += c;
99  state[3] += d;
100  state[4] += e;
101 
102  /* Wipe variables */
103  a = b = c = d = e = 0;
104 }
105 
106 
107 /*
108  * SHA1Init - Initialize new context
109  */
110 void
111 SHA1Init(SHA1_CTX *context)
112 {
113 
114  /* SHA1 initialization constants */
115  context->count = 0;
116  context->state[0] = 0x67452301;
117  context->state[1] = 0xEFCDAB89;
118  context->state[2] = 0x98BADCFE;
119  context->state[3] = 0x10325476;
120  context->state[4] = 0xC3D2E1F0;
121 }
122 
123 
124 /*
125  * Run your data through this.
126  */
127 void
128 SHA1Update(SHA1_CTX *context, const uint8_t *data, size_t len)
129 {
130  size_t i, j;
131 
132  j = (size_t)((context->count >> 3) & 63);
133  context->count += (len << 3);
134  if ((j + len) > 63) {
135  (void)memcpy(&context->buffer[j], data, (i = 64-j));
136  SHA1Transform(context->state, context->buffer);
137  for ( ; i + 63 < len; i += 64)
138  SHA1Transform(context->state, (uint8_t *)&data[i]);
139  j = 0;
140  } else {
141  i = 0;
142  }
143  (void)memcpy(&context->buffer[j], &data[i], len - i);
144 }
145 
146 
147 /*
148  * Add padding and return the message digest.
149  */
150 void
151 SHA1Pad(SHA1_CTX *context)
152 {
153  uint8_t finalcount[8];
154  u_int i;
155 
156  for (i = 0; i < 8; i++) {
157  finalcount[i] = (uint8_t)((context->count >>
158  ((7 - (i & 7)) * 8)) & 255); /* Endian independent */
159  }
160  SHA1Update(context, (uint8_t *)"\200", 1);
161  while ((context->count & 504) != 448)
162  SHA1Update(context, (uint8_t *)"\0", 1);
163  SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */
164 }
165 
166 void
167 SHA1Final(uint8_t digest[SHA1_DIGEST_LENGTH], SHA1_CTX *context)
168 {
169  u_int i;
170 
171  SHA1Pad(context);
172  if (digest) {
173  for (i = 0; i < SHA1_DIGEST_LENGTH; i++) {
174  digest[i] = (uint8_t)
175  ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
176  }
177  memset(context, 0, sizeof(*context));
178  }
179 }
Definition: sha1.h:28
System Include Files.