2 * This file is part of the libpayload project.
4 * It has originally been taken from the OpenBSD project.
7 /* $OpenBSD: sha1.c,v 1.20 2005/08/08 08:05:35 espie Exp $ */
11 * By Steve Reid <steve@edmweb.com>
14 * Test Vectors (from FIPS PUB 180-1)
16 * A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
17 * "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
18 * 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
19 * A million repetitions of "a"
20 * 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
23 #include <libpayload.h>
26 typedef u32 u_int32_t;
27 typedef u64 u_int64_t;
28 typedef unsigned int u_int;
31 #include <sys/param.h>
36 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
39 * blk0() and blk() perform the initial expand.
40 * I got the idea of expanding during the round function from SSLeay
42 #if BYTE_ORDER == LITTLE_ENDIAN
43 # define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
44 |(rol(block->l[i],8)&0x00FF00FF))
46 # define blk0(i) block->l[i]
48 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
49 ^block->l[(i+2)&15]^block->l[i&15],1))
52 * (R0+R1), R2, R3, R4 are the different operations (rounds) used in SHA1
54 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
55 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
56 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
57 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
58 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
61 * Hash a single 512-bit block. This is the core of the algorithm.
64 SHA1Transform(u_int32_t state[5], const u_int8_t buffer[SHA1_BLOCK_LENGTH])
66 u_int32_t a, b, c, d, e;
67 u_int8_t workspace[SHA1_BLOCK_LENGTH];
72 CHAR64LONG16 *block = (CHAR64LONG16 *)workspace;
74 (void)memcpy(block, buffer, SHA1_BLOCK_LENGTH);
76 /* Copy context->state[] to working vars */
83 /* 4 rounds of 20 operations each. Loop unrolled. */
84 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);
85 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);
86 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);
87 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);
88 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);
89 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);
90 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);
91 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);
92 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);
93 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);
94 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);
95 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);
96 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);
97 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);
98 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);
99 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);
100 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);
101 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);
102 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);
103 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);
105 /* Add the working vars back into context.state[] */
113 a = b = c = d = e = 0;
118 * SHA1Init - Initialize new context
121 SHA1Init(SHA1_CTX *context)
124 /* SHA1 initialization constants */
126 context->state[0] = 0x67452301;
127 context->state[1] = 0xEFCDAB89;
128 context->state[2] = 0x98BADCFE;
129 context->state[3] = 0x10325476;
130 context->state[4] = 0xC3D2E1F0;
135 * Run your data through this.
138 SHA1Update(SHA1_CTX *context, const u_int8_t *data, size_t len)
142 j = (size_t)((context->count >> 3) & 63);
143 context->count += (len << 3);
144 if ((j + len) > 63) {
145 (void)memcpy(&context->buffer[j], data, (i = 64-j));
146 SHA1Transform(context->state, context->buffer);
147 for ( ; i + 63 < len; i += 64)
148 SHA1Transform(context->state, (u_int8_t *)&data[i]);
153 (void)memcpy(&context->buffer[j], &data[i], len - i);
158 * Add padding and return the message digest.
161 SHA1Pad(SHA1_CTX *context)
163 u_int8_t finalcount[8];
166 for (i = 0; i < 8; i++) {
167 finalcount[i] = (u_int8_t)((context->count >>
168 ((7 - (i & 7)) * 8)) & 255); /* Endian independent */
170 SHA1Update(context, (u_int8_t *)"\200", 1);
171 while ((context->count & 504) != 448)
172 SHA1Update(context, (u_int8_t *)"\0", 1);
173 SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */
177 SHA1Final(u_int8_t digest[SHA1_DIGEST_LENGTH], SHA1_CTX *context)
183 for (i = 0; i < SHA1_DIGEST_LENGTH; i++) {
184 digest[i] = (u_int8_t)
185 ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
187 memset(context, 0, sizeof(*context));
192 * Compute the SHA-1 hash of the given data as specified by the 'data' and
193 * 'len' arguments, and place the result -- 160 bits (20 bytes) -- into the
194 * specified output buffer 'buf'.
196 * @param data Pointer to the input data that shall be hashed.
197 * @param len Length of the input data (in bytes).
198 * @param buf Buffer which will hold the resulting hash (must be at
199 * least 20 bytes in size).
200 * @return Pointer to the output buffer where the hash is stored.
202 u8 *sha1(const u8 *data, size_t len, u8 *buf)
207 SHA1Update(&ctx, data, len);
208 SHA1Final(buf, &ctx);