4 * Parts of this file are based on public domain code written by Steve Reid.
8 * Copyright (C) 2012, 2013 Eric Biggers
10 * This file is part of wimlib, a library for working with WIM files.
12 * wimlib is free software; you can redistribute it and/or modify it under the
13 * terms of the GNU General Public License as published by the Free
14 * Software Foundation; either version 3 of the License, or (at your option)
17 * wimlib is distributed in the hope that it will be useful, but WITHOUT ANY
18 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
19 * A PARTICULAR PURPOSE. See the GNU General Public License for more
22 * You should have received a copy of the GNU General Public License
23 * along with wimlib; if not, see http://www.gnu.org/licenses/.
29 #include "endianness.h"
32 /* The SHA1 support in wimlib can use an external libcrypto (part of openssl) or
33 * use a built-in SHA1 function. The built-in functions are either based on
34 * Steve Reid's public domain code, or based on Intel's SSSE3 SHA1 code.
37 const u8 zero_hash[SHA1_HASH_SIZE] = {
45 #ifndef WITH_LIBCRYPTO
47 /* Initialize new context */
49 sha1_init(SHA_CTX* context)
51 /* SHA1 initialization constants */
52 context->state[0] = 0x67452301;
53 context->state[1] = 0xEFCDAB89;
54 context->state[2] = 0x98BADCFE;
55 context->state[3] = 0x10325476;
56 context->state[4] = 0xC3D2E1F0;
57 context->count[0] = context->count[1] = 0;
60 #ifdef ENABLE_SSSE3_SHA1
62 sha1_update_intel(int *hash, const void* input, size_t num_blocks);
65 sha1_update(SHA_CTX *context, const void *data, size_t len)
67 sha1_update_intel((int*)&context->state, data, len / 64);
68 size_t j = (context->count[0] >> 3) & 63;
69 if ((context->count[0] += len << 3) < (len << 3))
71 context->count[1] += (len >> 29);
78 "Cannot calculate SHA1 message digest: CPU does not support SSSE3\n"
79 "instructions! Recompile wimlib without the --enable-ssse3-sha1 flag\n"
80 "to use wimlib on this CPU.\n");
83 #else /* ENABLE_SSSE3_SHA1 */
85 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
87 /* blk0() and blk() perform the initial expand. */
88 /* I got the idea of expanding during the round function from SSLeay */
89 /* FIXME: can we do this in an endian-proof way? */
90 #ifdef WORDS_BIGENDIAN
91 #define blk0(i) block->l[i]
93 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
94 |(rol(block->l[i],8)&0x00FF00FF))
96 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
97 ^block->l[(i+2)&15]^block->l[i&15],1))
99 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
100 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
101 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
102 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
103 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
104 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
106 /* Hash a single 512-bit block. This is the core of the algorithm. */
108 sha1_transform(u32 state[5], const u8 buffer[64])
118 block = (CHAR64LONG16*)workspace;
119 memcpy(block, buffer, 64);
121 /* Copy context->state[] to working vars */
128 /* 4 rounds of 20 operations each. Loop unrolled. */
129 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);
130 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);
131 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);
132 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);
133 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);
134 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);
135 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);
136 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);
137 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);
138 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);
139 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);
140 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);
141 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);
142 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);
143 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);
144 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);
145 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);
146 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);
147 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);
148 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);
150 /* Add the working vars back into context.state[] */
159 sha1_update(SHA_CTX* context, const void *data, const size_t len)
163 j = (context->count[0] >> 3) & 63;
164 if ((context->count[0] += len << 3) < (len << 3))
166 context->count[1] += (len >> 29);
167 if ((j + len) > 63) {
169 memcpy(&context->buffer[j], data, i);
170 sha1_transform(context->state, context->buffer);
171 for ( ; i + 63 < len; i += 64)
172 sha1_transform(context->state, data + i);
177 memcpy(&context->buffer[j], data + i, len - i);
180 #endif /* !ENABLE_SSSE3_SHA1 */
182 /* Add padding and return the message digest. */
184 sha1_final(u8 md[SHA1_HASH_SIZE], SHA_CTX* context)
189 for (i = 0; i < 8; i++) {
190 finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
191 >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */
193 sha1_update(context, (u8 *)"\200", 1);
194 while ((context->count[0] & 504) != 448) {
195 sha1_update(context, (u8 *)"\0", 1);
197 sha1_update(context, finalcount, 8); /* Should cause a sha1_transform() */
198 for (i = 0; i < SHA1_HASH_SIZE; i++) {
199 md[i] = (u8)((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
204 sha1_buffer(const void *buffer, size_t len, u8 md[SHA1_HASH_SIZE])
208 sha1_update(&ctx, buffer, len);
209 sha1_final(md, &ctx);
212 #endif /* !WITH_LIBCRYPTO */