1 /* $OpenBSD: sha1.c,v 1.27 2019/06/07 22:56:36 dtucker Exp $ */
2
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 "includes.h"
18
19 #ifndef WITH_OPENSSL
20
21 #include <sys/types.h>
22 #include <string.h>
23
24 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
25
26 /*
27 * blk0() and blk() perform the initial expand.
28 * I got the idea of expanding during the round function from SSLeay
29 */
30 #if BYTE_ORDER == LITTLE_ENDIAN
31 # define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
32 |(rol(block->l[i],8)&0x00FF00FF))
33 #else
34 # define blk0(i) block->l[i]
35 #endif
36 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
37 ^block->l[(i+2)&15]^block->l[i&15],1))
38
39 /*
40 * (R0+R1), R2, R3, R4 are the different operations (rounds) used in SHA1
41 */
42 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
43 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
44 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
45 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
46 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
47
48 typedef union {
49 u_int8_t c[64];
50 u_int32_t l[16];
51 } CHAR64LONG16;
52
53 /*
54 * Hash a single 512-bit block. This is the core of the algorithm.
55 */
56 void
SHA1Transform(u_int32_t state[5],const u_int8_t buffer[SHA1_BLOCK_LENGTH])57 SHA1Transform(u_int32_t state[5], const u_int8_t buffer[SHA1_BLOCK_LENGTH])
58 {
59 u_int32_t a, b, c, d, e;
60 u_int8_t workspace[SHA1_BLOCK_LENGTH];
61 CHAR64LONG16 *block = (CHAR64LONG16 *)workspace;
62
63 (void)memcpy(block, buffer, SHA1_BLOCK_LENGTH);
64
65 /* Copy context->state[] to working vars */
66 a = state[0];
67 b = state[1];
68 c = state[2];
69 d = state[3];
70 e = state[4];
71
72 /* 4 rounds of 20 operations each. Loop unrolled. */
73 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);
74 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);
75 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);
76 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);
77 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);
78 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);
79 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);
80 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);
81 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);
82 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);
83 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);
84 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);
85 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);
86 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);
87 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);
88 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);
89 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);
90 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);
91 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);
92 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);
93
94 /* Add the working vars back into context.state[] */
95 state[0] += a;
96 state[1] += b;
97 state[2] += c;
98 state[3] += d;
99 state[4] += e;
100
101 /* Wipe variables */
102 a = b = c = d = e = 0;
103 }
104 DEF_WEAK(SHA1Transform);
105
106
107 /*
108 * SHA1Init - Initialize new context
109 */
110 void
SHA1Init(SHA1_CTX * context)111 SHA1Init(SHA1_CTX *context)
112 {
113
114 /* SHA1 initialization constants */
115 context->count = 0;
116 context->state[0] = 0x67452301;
117 context->state[1] = 0xEFCDAB89;
118 context->state[2] = 0x98BADCFE;
119 context->state[3] = 0x10325476;
120 context->state[4] = 0xC3D2E1F0;
121 }
122 DEF_WEAK(SHA1Init);
123
124
125 /*
126 * Run your data through this.
127 */
128 void
SHA1Update(SHA1_CTX * context,const u_int8_t * data,size_t len)129 SHA1Update(SHA1_CTX *context, const u_int8_t *data, size_t len)
130 {
131 size_t i, j;
132
133 j = (size_t)((context->count >> 3) & 63);
134 context->count += ((u_int64_t)len << 3);
135 if ((j + len) > 63) {
136 (void)memcpy(&context->buffer[j], data, (i = 64-j));
137 SHA1Transform(context->state, context->buffer);
138 for ( ; i + 63 < len; i += 64)
139 SHA1Transform(context->state, (u_int8_t *)&data[i]);
140 j = 0;
141 } else {
142 i = 0;
143 }
144 (void)memcpy(&context->buffer[j], &data[i], len - i);
145 }
146 DEF_WEAK(SHA1Update);
147
148
149 /*
150 * Add padding and return the message digest.
151 */
152 void
SHA1Pad(SHA1_CTX * context)153 SHA1Pad(SHA1_CTX *context)
154 {
155 u_int8_t finalcount[8];
156 u_int i;
157
158 for (i = 0; i < 8; i++) {
159 finalcount[i] = (u_int8_t)((context->count >>
160 ((7 - (i & 7)) * 8)) & 255); /* Endian independent */
161 }
162 SHA1Update(context, (u_int8_t *)"\200", 1);
163 while ((context->count & 504) != 448)
164 SHA1Update(context, (u_int8_t *)"\0", 1);
165 SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */
166 }
167 DEF_WEAK(SHA1Pad);
168
169 void
SHA1Final(u_int8_t digest[SHA1_DIGEST_LENGTH],SHA1_CTX * context)170 SHA1Final(u_int8_t digest[SHA1_DIGEST_LENGTH], SHA1_CTX *context)
171 {
172 u_int i;
173
174 SHA1Pad(context);
175 for (i = 0; i < SHA1_DIGEST_LENGTH; i++) {
176 digest[i] = (u_int8_t)
177 ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
178 }
179 explicit_bzero(context, sizeof(*context));
180 }
181 DEF_WEAK(SHA1Final);
182 #endif /* !WITH_OPENSSL */
183