4 * Implementation of the Secure Hash Algorithm version 1 (FIPS 180-1).
9 * The default SHA-1 transform is based on public domain code by Steve Reid.
11 * The author dedicates this file to the public domain.
12 * You can do whatever you want with this file.
19 #include "wimlib/endianness.h"
20 #include "wimlib/sha1.h"
21 #include "wimlib/unaligned.h"
23 /* Dummy SHA-1 message digest of all 0's. This is used in the WIM format to
24 * mean "SHA-1 not specified". */
25 const u8 zero_hash[20];
28 * Builds a hexadecimal string representation of a SHA-1 message digest.
30 * The output buffer must be at least 41 characters.
33 sprint_hash(const u8 hash[SHA1_HASH_SIZE], tchar strbuf[SHA1_HASH_SIZE * 2 + 1])
38 for (i = 0; i < SHA1_HASH_SIZE; i++) {
41 strbuf[i * 2 + 0] = (high < 10 ? high + '0' : high - 10 + 'a');
42 strbuf[i * 2 + 1] = (low < 10 ? low + '0' : low - 10 + 'a');
47 /* If we use libcrypto (e.g. OpenSSL) then we get all the SHA-1 functions for
48 * free. Otherwise we need to implement them ourselves. */
50 #ifndef WITH_LIBCRYPTO
52 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
54 #define blk0(i) (tmp[i] = be32_to_cpu(load_be32_unaligned(&(block)[(i) * 4])))
56 #define blk(i) (tmp[i & 15] = rol(tmp[(i + 13) & 15] ^ \
59 tmp[(i + 0) & 15], 1))
61 #define R0(v, w, x, y, z, i) \
62 z += ((w & (x ^ y)) ^ y) + blk0(i) + 0x5A827999 + rol(v, 5); \
65 #define R1(v, w, x, y, z, i) \
66 z += ((w & (x ^ y)) ^ y) + blk(i) + 0x5A827999 + rol(v, 5); \
69 #define R2(v, w, x, y, z, i) \
70 z += (w ^ x ^ y) + blk(i) + 0x6ED9EBA1 + rol(v, 5); \
73 #define R3(v, w, x, y, z, i) \
74 z += (((w | x) & y) | (w & x)) + blk(i) + 0x8F1BBCDC + rol(v, 5); \
77 #define R4(v, w, x, y, z, i) \
78 z += (w ^ x ^ y) + blk(i) + 0xCA62C1D6 + rol(v, 5); \
81 /* Hash a single 512-bit block. This is the core of the algorithm. */
83 sha1_transform_default(u32 state[5], const u8 block[64])
88 /* Copy ctx->state[] to working vars */
95 /* 4 rounds of 20 operations each. Loop unrolled. */
96 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);
97 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);
98 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);
99 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);
100 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);
101 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);
102 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);
103 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);
104 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);
105 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);
106 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);
107 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);
108 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);
109 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);
110 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);
111 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);
112 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);
113 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);
114 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);
115 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);
117 /* Add the working vars back into context.state[] */
125 #ifdef ENABLE_SSSE3_SHA1
127 sha1_transform_blocks_ssse3(u32 state[5], const void *data, size_t num_blocks);
129 sha1_transform_blocks_default(u32 state[5], const void *data, size_t num_blocks);
130 # define sha1_transform_blocks sha1_transform_blocks_ssse3
132 # define sha1_transform_blocks sha1_transform_blocks_default
135 #ifndef ENABLE_SSSE3_SHA1
139 sha1_transform_blocks_default(u32 state[5], const void *data, size_t num_blocks)
142 sha1_transform_default(state, data);
144 } while (--num_blocks);
147 /* Initializes the specified SHA-1 context.
149 * After sha1_init(), call sha1_update() zero or more times to provide the data
150 * to be hashed. Then call sha1_final() to get the final hash. */
152 sha1_init(SHA_CTX *ctx)
156 ctx->state[0] = 0x67452301;
157 ctx->state[1] = 0xEFCDAB89;
158 ctx->state[2] = 0x98BADCFE;
159 ctx->state[3] = 0x10325476;
160 ctx->state[4] = 0xC3D2E1F0;
163 /* Updates the SHA-1 context with @len bytes of data. */
165 sha1_update(SHA_CTX *ctx, const void *data, size_t len)
167 unsigned buffered = ctx->bytecount & 63;
169 ctx->bytecount += len;
172 /* Previous block is unfinished. */
173 if (len < 64 - buffered) {
174 memcpy(&ctx->buffer[buffered], data, len);
175 /* Previous block still unfinished. */
178 memcpy(&ctx->buffer[buffered], data, 64 - buffered);
179 /* Finished the previous block. */
180 sha1_transform_blocks(ctx->state, ctx->buffer, 1);
181 data += 64 - buffered;
182 len -= 64 - buffered;
186 /* Process blocks directly from the input data. */
188 sha1_transform_blocks(ctx->state, data, len / 64);
193 /* Copy any remaining bytes to the buffer. */
195 memcpy(ctx->buffer, data, len);
198 /* Pad the message and generate the final SHA-1 message digest. */
200 sha1_final(u8 md[20], SHA_CTX *ctx)
202 /* Logically, we must append 1 bit, then a variable number of 0 bits,
203 * then the message length in bits as a big-endian integer, so that the
204 * final length is a multiple of the block size. */
205 static const u8 padding[64] = {0x80, };
206 be64 finalcount = cpu_to_be64(ctx->bytecount << 3);
208 sha1_update(ctx, padding, 64 - ((ctx->bytecount + 8) & 63));
209 sha1_update(ctx, &finalcount, 8);
211 for (int i = 0; i < 5; i++)
212 store_be32_unaligned(cpu_to_be32(ctx->state[i]), &md[i * 4]);
215 /* Calculate the SHA-1 message digest of the specified buffer.
216 * @len is the buffer length in bytes. */
218 sha1_buffer(const void *buffer, size_t len, u8 md[20])
223 sha1_update(&ctx, buffer, len);
224 sha1_final(md, &ctx);
227 #endif /* !WITH_LIBCRYPTO */