diff options
author | Christian Grothoff <christian@grothoff.org> | 2010-09-01 13:43:49 +0000 |
---|---|---|
committer | Christian Grothoff <christian@grothoff.org> | 2010-09-01 13:43:49 +0000 |
commit | a0d447bbbb23befeaea98751016a2a3d238ec4ab (patch) | |
tree | 37fe68d6cef06c9ab6ab9cf09c6b33bf158d19ac | |
parent | ac0043ff0ae833bcaea1b26440dfe6472f851486 (diff) | |
download | libmicrohttpd-a0d447bbbb23befeaea98751016a2a3d238ec4ab.tar.gz libmicrohttpd-a0d447bbbb23befeaea98751016a2a3d238ec4ab.zip |
dead
-rw-r--r-- | src/daemon/Makefile.am | 3 | ||||
-rw-r--r-- | src/daemon/sha1.c | 166 | ||||
-rw-r--r-- | src/daemon/sha1.h | 44 |
3 files changed, 1 insertions, 212 deletions
diff --git a/src/daemon/Makefile.am b/src/daemon/Makefile.am index 50f2ffd6..4a380b35 100644 --- a/src/daemon/Makefile.am +++ b/src/daemon/Makefile.am | |||
@@ -37,8 +37,7 @@ endif | |||
37 | if ENABLE_DAUTH | 37 | if ENABLE_DAUTH |
38 | libmicrohttpd_la_SOURCES += \ | 38 | libmicrohttpd_la_SOURCES += \ |
39 | digestauth.c \ | 39 | digestauth.c \ |
40 | md5.c md5.h \ | 40 | md5.c md5.h |
41 | sha1.c sha1.h | ||
42 | endif | 41 | endif |
43 | 42 | ||
44 | if ENABLE_HTTPS | 43 | if ENABLE_HTTPS |
diff --git a/src/daemon/sha1.c b/src/daemon/sha1.c deleted file mode 100644 index 91187ddb..00000000 --- a/src/daemon/sha1.c +++ /dev/null | |||
@@ -1,166 +0,0 @@ | |||
1 | /* | ||
2 | SHA-1 in C | ||
3 | By Steve Reid <steve@edmweb.com> | ||
4 | 100% Public Domain | ||
5 | |||
6 | Test Vectors (from FIPS PUB 180-1) | ||
7 | "abc" | ||
8 | A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D | ||
9 | "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq" | ||
10 | 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1 | ||
11 | A million repetitions of "a" | ||
12 | 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F | ||
13 | */ | ||
14 | |||
15 | #include "sha1.h" | ||
16 | |||
17 | #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits)))) | ||
18 | |||
19 | /* blk0() and blk() perform the initial expand. */ | ||
20 | /* I got the idea of expanding during the round function from SSLeay */ | ||
21 | #ifdef LITTLE_ENDIAN | ||
22 | #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \ | ||
23 | |(rol(block->l[i],8)&0x00FF00FF)) | ||
24 | #else | ||
25 | #define blk0(i) block->l[i] | ||
26 | #endif | ||
27 | #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \ | ||
28 | ^block->l[(i+2)&15]^block->l[i&15],1)) | ||
29 | |||
30 | /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */ | ||
31 | #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30); | ||
32 | #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30); | ||
33 | #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30); | ||
34 | #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30); | ||
35 | #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30); | ||
36 | |||
37 | |||
38 | /* Hash a single 512-bit block. This is the core of the algorithm. */ | ||
39 | |||
40 | static void | ||
41 | SHA1Transform(unsigned long state[5], | ||
42 | const unsigned char buffer[64]) | ||
43 | { | ||
44 | unsigned long a, b, c, d, e; | ||
45 | typedef union { | ||
46 | unsigned char c[64]; | ||
47 | unsigned long l[16]; | ||
48 | } CHAR64LONG16; | ||
49 | CHAR64LONG16* block; | ||
50 | #ifdef SHA1HANDSOFF | ||
51 | static unsigned char workspace[64]; | ||
52 | block = (CHAR64LONG16*)workspace; | ||
53 | memcpy(block, buffer, 64); | ||
54 | #else | ||
55 | block = (CHAR64LONG16*)buffer; | ||
56 | #endif | ||
57 | /* Copy context->state[] to working vars */ | ||
58 | a = state[0]; | ||
59 | b = state[1]; | ||
60 | c = state[2]; | ||
61 | d = state[3]; | ||
62 | e = state[4]; | ||
63 | /* 4 rounds of 20 operations each. Loop unrolled. */ | ||
64 | 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); | ||
65 | 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); | ||
66 | 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); | ||
67 | 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); | ||
68 | 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); | ||
69 | 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); | ||
70 | 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); | ||
71 | 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); | ||
72 | 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); | ||
73 | 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); | ||
74 | 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); | ||
75 | 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); | ||
76 | 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); | ||
77 | 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); | ||
78 | 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); | ||
79 | 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); | ||
80 | 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); | ||
81 | 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); | ||
82 | 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); | ||
83 | 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); | ||
84 | /* Add the working vars back into context.state[] */ | ||
85 | state[0] += a; | ||
86 | state[1] += b; | ||
87 | state[2] += c; | ||
88 | state[3] += d; | ||
89 | state[4] += e; | ||
90 | /* Wipe variables */ | ||
91 | a = b = c = d = e = 0; | ||
92 | } | ||
93 | |||
94 | |||
95 | /* SHA1Init - Initialize new context */ | ||
96 | |||
97 | void SHA1Init(struct SHA1Context* context) | ||
98 | { | ||
99 | /* SHA1 initialization constants */ | ||
100 | context->state[0] = 0x67452301; | ||
101 | context->state[1] = 0xEFCDAB89; | ||
102 | context->state[2] = 0x98BADCFE; | ||
103 | context->state[3] = 0x10325476; | ||
104 | context->state[4] = 0xC3D2E1F0; | ||
105 | context->count[0] = context->count[1] = 0; | ||
106 | } | ||
107 | |||
108 | |||
109 | /* Run your data through this. */ | ||
110 | |||
111 | void SHA1Update(struct SHA1Context* context, | ||
112 | const void *buf, unsigned int len) | ||
113 | { | ||
114 | const unsigned char* data = buf; | ||
115 | unsigned int i, j; | ||
116 | |||
117 | j = (context->count[0] >> 3) & 63; | ||
118 | if ((context->count[0] += len << 3) < (len << 3)) context->count[1]++; | ||
119 | context->count[1] += (len >> 29); | ||
120 | if ((j + len) > 63) { | ||
121 | memcpy(&context->buffer[j], data, (i = 64-j)); | ||
122 | SHA1Transform(context->state, context->buffer); | ||
123 | for ( ; i + 63 < len; i += 64) { | ||
124 | SHA1Transform(context->state, &data[i]); | ||
125 | } | ||
126 | j = 0; | ||
127 | } | ||
128 | else i = 0; | ||
129 | memcpy(&context->buffer[j], &data[i], len - i); | ||
130 | } | ||
131 | |||
132 | |||
133 | /* Add padding and return the message digest. */ | ||
134 | |||
135 | void SHA1Final(unsigned char digest[SHA1_DIGEST_SIZE], | ||
136 | struct SHA1Context* context) | ||
137 | { | ||
138 | unsigned long i, j; | ||
139 | unsigned char finalcount[8]; | ||
140 | |||
141 | for (i = 0; i < 8; i++) { | ||
142 | finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)] | ||
143 | >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */ | ||
144 | } | ||
145 | SHA1Update(context, (unsigned char *)"\200", 1); | ||
146 | while ((context->count[0] & 504) != 448) { | ||
147 | SHA1Update(context, (unsigned char *)"\0", 1); | ||
148 | } | ||
149 | SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */ | ||
150 | for (i = 0; i < SHA1_DIGEST_SIZE; i++) { | ||
151 | digest[i] = (unsigned char) | ||
152 | ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255); | ||
153 | } | ||
154 | /* Wipe variables */ | ||
155 | i = j = 0; | ||
156 | memset(context->buffer, 0, 64); | ||
157 | memset(context->state, 0, 20); | ||
158 | memset(context->count, 0, 8); | ||
159 | memset(&finalcount, 0, 8); | ||
160 | #ifdef SHA1HANDSOFF /* make SHA1Transform overwrite it's own static vars */ | ||
161 | SHA1Transform(context->state, context->buffer); | ||
162 | #endif | ||
163 | } | ||
164 | |||
165 | |||
166 | /* end of sha1.c */ | ||
diff --git a/src/daemon/sha1.h b/src/daemon/sha1.h deleted file mode 100644 index 73bdd76e..00000000 --- a/src/daemon/sha1.h +++ /dev/null | |||
@@ -1,44 +0,0 @@ | |||
1 | #ifndef SHA1_H | ||
2 | #define SHA1_H | ||
3 | /* | ||
4 | SHA-1 in C | ||
5 | By Steve Reid <steve@edmweb.com> | ||
6 | 100% Public Domain | ||
7 | |||
8 | Test Vectors (from FIPS PUB 180-1) | ||
9 | "abc" | ||
10 | A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D | ||
11 | "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq" | ||
12 | 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1 | ||
13 | A million repetitions of "a" | ||
14 | 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F | ||
15 | */ | ||
16 | |||
17 | #include "MHD_config.h" | ||
18 | |||
19 | #ifndef WORDS_BIGENDIAN | ||
20 | #ifndef LITTLE_ENDIAN | ||
21 | #define LITTLE_ENDIAN | ||
22 | #endif | ||
23 | #endif | ||
24 | |||
25 | #include <stdio.h> | ||
26 | #include <string.h> | ||
27 | |||
28 | struct SHA1Context { | ||
29 | unsigned long state[5]; | ||
30 | unsigned long count[2]; | ||
31 | unsigned char buffer[64]; | ||
32 | }; | ||
33 | |||
34 | #define SHA1_DIGEST_SIZE 20 | ||
35 | |||
36 | void SHA1Init(struct SHA1Context* context); | ||
37 | void SHA1Update(struct SHA1Context* context, | ||
38 | const void* data, | ||
39 | unsigned int len); | ||
40 | void SHA1Final(unsigned char digest[SHA1_DIGEST_SIZE], | ||
41 | struct SHA1Context* context); | ||
42 | |||
43 | |||
44 | #endif | ||