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