Mercurial > dovecot > original-hg > dovecot-1.2
annotate src/lib/sha1.c @ 2628:59059ea978b2 HEAD
Change src from unsigned char* toi void* so callers don't have to do
casting always.
| author | Timo Sirainen <tss@iki.fi> |
|---|---|
| date | Wed, 15 Sep 2004 16:19:47 +0300 |
| parents | 161a9e818ad6 |
| children | 211f0c9588c2 |
| rev | line source |
|---|---|
| 2370 | 1 /* $KAME: sha1.c,v 1.5 2000/11/08 06:13:08 itojun Exp $ */ |
| 2 /* | |
| 3 * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project. | |
| 4 * All rights reserved. | |
| 5 * | |
| 6 * Redistribution and use in source and binary forms, with or without | |
| 7 * modification, are permitted provided that the following conditions | |
| 8 * are met: | |
| 9 * 1. Redistributions of source code must retain the above copyright | |
| 10 * notice, this list of conditions and the following disclaimer. | |
| 11 * 2. Redistributions in binary form must reproduce the above copyright | |
| 12 * notice, this list of conditions and the following disclaimer in the | |
| 13 * documentation and/or other materials provided with the distribution. | |
| 14 * 3. Neither the name of the project nor the names of its contributors | |
| 15 * may be used to endorse or promote products derived from this software | |
| 16 * without specific prior written permission. | |
| 17 * | |
| 18 * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND | |
| 19 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
| 20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
| 21 * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE | |
| 22 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
| 23 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
| 24 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
| 25 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
| 26 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
| 27 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
| 28 * SUCH DAMAGE. | |
| 29 */ | |
| 30 | |
| 31 /* | |
| 32 * FIPS pub 180-1: Secure Hash Algorithm (SHA-1) | |
| 33 * based on: http://csrc.nist.gov/fips/fip180-1.txt | |
| 34 * implemented by Jun-ichiro itojun Itoh <itojun@itojun.org> | |
| 35 */ | |
| 36 | |
|
2385
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
37 #include "lib.h" |
| 2370 | 38 #include "sha1.h" |
| 39 #include "safe-memset.h" | |
| 40 | |
| 41 /* sanity check */ | |
| 42 #if BYTE_ORDER != BIG_ENDIAN | |
| 43 # if BYTE_ORDER != LITTLE_ENDIAN | |
| 44 # define unsupported 1 | |
| 45 # endif | |
| 46 #endif | |
| 47 | |
| 48 #ifndef unsupported | |
| 49 | |
| 50 /* constant table */ | |
|
2385
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
51 static uint32_t _K[] = { 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6 }; |
| 2370 | 52 #define K(t) _K[(t) / 20] |
| 53 | |
| 54 #define F0(b, c, d) (((b) & (c)) | ((~(b)) & (d))) | |
| 55 #define F1(b, c, d) (((b) ^ (c)) ^ (d)) | |
| 56 #define F2(b, c, d) (((b) & (c)) | ((b) & (d)) | ((c) & (d))) | |
| 57 #define F3(b, c, d) (((b) ^ (c)) ^ (d)) | |
| 58 | |
| 59 #define S(n, x) (((x) << (n)) | ((x) >> (32 - n))) | |
| 60 | |
| 61 #define H(n) (ctxt->h.b32[(n)]) | |
| 62 #define COUNT (ctxt->count) | |
| 63 #define BCOUNT (ctxt->c.b64[0] / 8) | |
| 64 #define W(n) (ctxt->m.b32[(n)]) | |
| 65 | |
| 66 #define PUTBYTE(x) { \ | |
| 67 ctxt->m.b8[(COUNT % 64)] = (x); \ | |
| 68 COUNT++; \ | |
| 69 COUNT %= 64; \ | |
| 70 ctxt->c.b64[0] += 8; \ | |
| 71 if (COUNT % 64 == 0) \ | |
| 72 sha1_step(ctxt); \ | |
| 73 } | |
| 74 | |
| 75 #define PUTPAD(x) { \ | |
| 76 ctxt->m.b8[(COUNT % 64)] = (x); \ | |
| 77 COUNT++; \ | |
| 78 COUNT %= 64; \ | |
| 79 if (COUNT % 64 == 0) \ | |
| 80 sha1_step(ctxt); \ | |
| 81 } | |
| 82 | |
| 83 static void sha1_step(struct sha1_ctxt *); | |
| 84 | |
| 85 static void | |
|
2385
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
86 sha1_step(struct sha1_ctxt *ctxt) |
| 2370 | 87 { |
|
2385
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
88 uint32_t a, b, c, d, e; |
| 2370 | 89 size_t t, s; |
|
2385
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
90 uint32_t tmp; |
| 2370 | 91 |
| 92 #if BYTE_ORDER == LITTLE_ENDIAN | |
| 93 struct sha1_ctxt tctxt; | |
| 94 memmove(&tctxt.m.b8[0], &ctxt->m.b8[0], 64); | |
| 95 ctxt->m.b8[0] = tctxt.m.b8[3]; ctxt->m.b8[1] = tctxt.m.b8[2]; | |
| 96 ctxt->m.b8[2] = tctxt.m.b8[1]; ctxt->m.b8[3] = tctxt.m.b8[0]; | |
| 97 ctxt->m.b8[4] = tctxt.m.b8[7]; ctxt->m.b8[5] = tctxt.m.b8[6]; | |
| 98 ctxt->m.b8[6] = tctxt.m.b8[5]; ctxt->m.b8[7] = tctxt.m.b8[4]; | |
| 99 ctxt->m.b8[8] = tctxt.m.b8[11]; ctxt->m.b8[9] = tctxt.m.b8[10]; | |
| 100 ctxt->m.b8[10] = tctxt.m.b8[9]; ctxt->m.b8[11] = tctxt.m.b8[8]; | |
| 101 ctxt->m.b8[12] = tctxt.m.b8[15]; ctxt->m.b8[13] = tctxt.m.b8[14]; | |
| 102 ctxt->m.b8[14] = tctxt.m.b8[13]; ctxt->m.b8[15] = tctxt.m.b8[12]; | |
| 103 ctxt->m.b8[16] = tctxt.m.b8[19]; ctxt->m.b8[17] = tctxt.m.b8[18]; | |
| 104 ctxt->m.b8[18] = tctxt.m.b8[17]; ctxt->m.b8[19] = tctxt.m.b8[16]; | |
| 105 ctxt->m.b8[20] = tctxt.m.b8[23]; ctxt->m.b8[21] = tctxt.m.b8[22]; | |
| 106 ctxt->m.b8[22] = tctxt.m.b8[21]; ctxt->m.b8[23] = tctxt.m.b8[20]; | |
| 107 ctxt->m.b8[24] = tctxt.m.b8[27]; ctxt->m.b8[25] = tctxt.m.b8[26]; | |
| 108 ctxt->m.b8[26] = tctxt.m.b8[25]; ctxt->m.b8[27] = tctxt.m.b8[24]; | |
| 109 ctxt->m.b8[28] = tctxt.m.b8[31]; ctxt->m.b8[29] = tctxt.m.b8[30]; | |
| 110 ctxt->m.b8[30] = tctxt.m.b8[29]; ctxt->m.b8[31] = tctxt.m.b8[28]; | |
| 111 ctxt->m.b8[32] = tctxt.m.b8[35]; ctxt->m.b8[33] = tctxt.m.b8[34]; | |
| 112 ctxt->m.b8[34] = tctxt.m.b8[33]; ctxt->m.b8[35] = tctxt.m.b8[32]; | |
| 113 ctxt->m.b8[36] = tctxt.m.b8[39]; ctxt->m.b8[37] = tctxt.m.b8[38]; | |
| 114 ctxt->m.b8[38] = tctxt.m.b8[37]; ctxt->m.b8[39] = tctxt.m.b8[36]; | |
| 115 ctxt->m.b8[40] = tctxt.m.b8[43]; ctxt->m.b8[41] = tctxt.m.b8[42]; | |
| 116 ctxt->m.b8[42] = tctxt.m.b8[41]; ctxt->m.b8[43] = tctxt.m.b8[40]; | |
| 117 ctxt->m.b8[44] = tctxt.m.b8[47]; ctxt->m.b8[45] = tctxt.m.b8[46]; | |
| 118 ctxt->m.b8[46] = tctxt.m.b8[45]; ctxt->m.b8[47] = tctxt.m.b8[44]; | |
| 119 ctxt->m.b8[48] = tctxt.m.b8[51]; ctxt->m.b8[49] = tctxt.m.b8[50]; | |
| 120 ctxt->m.b8[50] = tctxt.m.b8[49]; ctxt->m.b8[51] = tctxt.m.b8[48]; | |
| 121 ctxt->m.b8[52] = tctxt.m.b8[55]; ctxt->m.b8[53] = tctxt.m.b8[54]; | |
| 122 ctxt->m.b8[54] = tctxt.m.b8[53]; ctxt->m.b8[55] = tctxt.m.b8[52]; | |
| 123 ctxt->m.b8[56] = tctxt.m.b8[59]; ctxt->m.b8[57] = tctxt.m.b8[58]; | |
| 124 ctxt->m.b8[58] = tctxt.m.b8[57]; ctxt->m.b8[59] = tctxt.m.b8[56]; | |
| 125 ctxt->m.b8[60] = tctxt.m.b8[63]; ctxt->m.b8[61] = tctxt.m.b8[62]; | |
| 126 ctxt->m.b8[62] = tctxt.m.b8[61]; ctxt->m.b8[63] = tctxt.m.b8[60]; | |
| 127 #endif | |
| 128 | |
| 129 a = H(0); b = H(1); c = H(2); d = H(3); e = H(4); | |
| 130 | |
| 131 for (t = 0; t < 20; t++) { | |
| 132 s = t & 0x0f; | |
| 133 if (t >= 16) { | |
| 134 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s)); | |
| 135 } | |
| 136 tmp = S(5, a) + F0(b, c, d) + e + W(s) + K(t); | |
| 137 e = d; d = c; c = S(30, b); b = a; a = tmp; | |
| 138 } | |
| 139 for (t = 20; t < 40; t++) { | |
| 140 s = t & 0x0f; | |
| 141 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s)); | |
| 142 tmp = S(5, a) + F1(b, c, d) + e + W(s) + K(t); | |
| 143 e = d; d = c; c = S(30, b); b = a; a = tmp; | |
| 144 } | |
| 145 for (t = 40; t < 60; t++) { | |
| 146 s = t & 0x0f; | |
| 147 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s)); | |
| 148 tmp = S(5, a) + F2(b, c, d) + e + W(s) + K(t); | |
| 149 e = d; d = c; c = S(30, b); b = a; a = tmp; | |
| 150 } | |
| 151 for (t = 60; t < 80; t++) { | |
| 152 s = t & 0x0f; | |
| 153 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s)); | |
| 154 tmp = S(5, a) + F3(b, c, d) + e + W(s) + K(t); | |
| 155 e = d; d = c; c = S(30, b); b = a; a = tmp; | |
| 156 } | |
| 157 | |
| 158 H(0) = H(0) + a; | |
| 159 H(1) = H(1) + b; | |
| 160 H(2) = H(2) + c; | |
| 161 H(3) = H(3) + d; | |
| 162 H(4) = H(4) + e; | |
| 163 | |
| 164 memset(&ctxt->m.b8[0], 0, 64); | |
| 165 } | |
| 166 | |
| 167 /*------------------------------------------------------------*/ | |
| 168 | |
| 169 void | |
|
2385
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
170 sha1_init(struct sha1_ctxt *ctxt) |
| 2370 | 171 { |
| 172 memset(ctxt, 0, sizeof(struct sha1_ctxt)); | |
| 173 H(0) = 0x67452301; | |
| 174 H(1) = 0xefcdab89; | |
| 175 H(2) = 0x98badcfe; | |
| 176 H(3) = 0x10325476; | |
| 177 H(4) = 0xc3d2e1f0; | |
| 178 } | |
| 179 | |
| 180 void | |
|
2385
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
181 sha1_pad(struct sha1_ctxt *ctxt) |
| 2370 | 182 { |
| 183 size_t padlen; /*pad length in bytes*/ | |
| 184 size_t padstart; | |
| 185 | |
| 186 PUTPAD(0x80); | |
| 187 | |
| 188 padstart = COUNT % 64; | |
| 189 padlen = 64 - padstart; | |
| 190 if (padlen < 8) { | |
| 191 memset(&ctxt->m.b8[padstart], 0, padlen); | |
| 192 COUNT += padlen; | |
| 193 COUNT %= 64; | |
| 194 sha1_step(ctxt); | |
| 195 padstart = COUNT % 64; /* should be 0 */ | |
| 196 padlen = 64 - padstart; /* should be 64 */ | |
| 197 } | |
| 198 memset(&ctxt->m.b8[padstart], 0, padlen - 8); | |
| 199 COUNT += (padlen - 8); | |
| 200 COUNT %= 64; | |
| 201 #if BYTE_ORDER == BIG_ENDIAN | |
| 202 PUTPAD(ctxt->c.b8[0]); PUTPAD(ctxt->c.b8[1]); | |
| 203 PUTPAD(ctxt->c.b8[2]); PUTPAD(ctxt->c.b8[3]); | |
| 204 PUTPAD(ctxt->c.b8[4]); PUTPAD(ctxt->c.b8[5]); | |
| 205 PUTPAD(ctxt->c.b8[6]); PUTPAD(ctxt->c.b8[7]); | |
| 206 #else | |
| 207 PUTPAD(ctxt->c.b8[7]); PUTPAD(ctxt->c.b8[6]); | |
| 208 PUTPAD(ctxt->c.b8[5]); PUTPAD(ctxt->c.b8[4]); | |
| 209 PUTPAD(ctxt->c.b8[3]); PUTPAD(ctxt->c.b8[2]); | |
| 210 PUTPAD(ctxt->c.b8[1]); PUTPAD(ctxt->c.b8[0]); | |
| 211 #endif | |
| 212 } | |
| 213 | |
| 214 void | |
|
2628
59059ea978b2
Change src from unsigned char* toi void* so callers don't have to do
Timo Sirainen <tss@iki.fi>
parents:
2385
diff
changeset
|
215 sha1_loop(struct sha1_ctxt *ctxt, const void *input, size_t len) |
| 2370 | 216 { |
|
2628
59059ea978b2
Change src from unsigned char* toi void* so callers don't have to do
Timo Sirainen <tss@iki.fi>
parents:
2385
diff
changeset
|
217 const unsigned char *input_c = input; |
| 2370 | 218 size_t gaplen; |
| 219 size_t gapstart; | |
| 220 size_t off; | |
| 221 size_t copysiz; | |
| 222 | |
| 223 off = 0; | |
| 224 | |
| 225 while (off < len) { | |
| 226 gapstart = COUNT % 64; | |
| 227 gaplen = 64 - gapstart; | |
| 228 | |
| 229 copysiz = (gaplen < len - off) ? gaplen : len - off; | |
|
2628
59059ea978b2
Change src from unsigned char* toi void* so callers don't have to do
Timo Sirainen <tss@iki.fi>
parents:
2385
diff
changeset
|
230 memmove(&ctxt->m.b8[gapstart], &input_c[off], copysiz); |
| 2370 | 231 COUNT += copysiz; |
| 232 COUNT %= 64; | |
| 233 ctxt->c.b64[0] += copysiz * 8; | |
| 234 if (COUNT % 64 == 0) | |
| 235 sha1_step(ctxt); | |
| 236 off += copysiz; | |
| 237 } | |
| 238 } | |
| 239 | |
| 240 void | |
|
2385
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
241 sha1_result(struct sha1_ctxt *ctxt, void *digest0) |
| 2370 | 242 { |
|
2385
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
243 uint8_t *digest; |
| 2370 | 244 |
|
2385
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
245 digest = (uint8_t *)digest0; |
| 2370 | 246 sha1_pad(ctxt); |
| 247 #if BYTE_ORDER == BIG_ENDIAN | |
| 248 memmove(digest, &ctxt->h.b8[0], 20); | |
| 249 #else | |
| 250 digest[0] = ctxt->h.b8[3]; digest[1] = ctxt->h.b8[2]; | |
| 251 digest[2] = ctxt->h.b8[1]; digest[3] = ctxt->h.b8[0]; | |
| 252 digest[4] = ctxt->h.b8[7]; digest[5] = ctxt->h.b8[6]; | |
| 253 digest[6] = ctxt->h.b8[5]; digest[7] = ctxt->h.b8[4]; | |
| 254 digest[8] = ctxt->h.b8[11]; digest[9] = ctxt->h.b8[10]; | |
| 255 digest[10] = ctxt->h.b8[9]; digest[11] = ctxt->h.b8[8]; | |
| 256 digest[12] = ctxt->h.b8[15]; digest[13] = ctxt->h.b8[14]; | |
| 257 digest[14] = ctxt->h.b8[13]; digest[15] = ctxt->h.b8[12]; | |
| 258 digest[16] = ctxt->h.b8[19]; digest[17] = ctxt->h.b8[18]; | |
| 259 digest[18] = ctxt->h.b8[17]; digest[19] = ctxt->h.b8[16]; | |
| 260 #endif | |
| 261 safe_memset(ctxt, 0, sizeof(struct sha1_ctxt)); | |
| 262 } | |
| 263 | |
|
2385
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
264 void sha1_get_digest(const void *data, size_t size, |
|
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
265 unsigned char result[SHA1_RESULTLEN]) |
| 2370 | 266 { |
| 267 struct sha1_ctxt ctx; | |
| 268 | |
| 269 sha1_init(&ctx); | |
| 270 sha1_loop(&ctx, data, size); | |
| 271 sha1_result(&ctx, result); | |
| 272 } | |
| 273 | |
| 274 #endif /*unsupported*/ |