1 /*	$OpenBSD: sha1.c,v 1.27 2019/06/07 22:56:36 dtucker Exp $	*/
4  * SHA-1 in C
8  * Test Vectors (from FIPS PUB 180-1)
10  *   A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
13  * A million repetitions of "a"
24 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
31 # define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
32     |(rol(block->l[i],8)&0x00FF00FF))
34 # define blk0(i) block->l[i]
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))
49 	u_int8_t c[64];  member
54  * Hash a single 512-bit block. This is the core of the algorithm.
59 	u_int32_t a, b, c, d, e;  in SHA1Transform()  local
65 	/* Copy context->state[] to working vars */  in SHA1Transform()
66 	a = state[0];  in SHA1Transform()
68 	c = state[2];  in SHA1Transform()
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);  in SHA1Transform()
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);  in SHA1Transform()
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);  in SHA1Transform()
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);  in SHA1Transform()
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);  in SHA1Transform()
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);  in SHA1Transform()
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);  in SHA1Transform()
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);  in SHA1Transform()
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);  in SHA1Transform()
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);  in SHA1Transform()
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);  in SHA1Transform()
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);  in SHA1Transform()
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);  in SHA1Transform()
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);  in SHA1Transform()
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);  in SHA1Transform()
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);  in SHA1Transform()
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);  in SHA1Transform()
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);  in SHA1Transform()
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);  in SHA1Transform()
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);  in SHA1Transform()
95 	state[0] += a;  in SHA1Transform()
97 	state[2] += c;  in SHA1Transform()
102 	a = b = c = d = e = 0;  in SHA1Transform()
108  * SHA1Init - Initialize new context
115 	context->count = 0;  in SHA1Init()
116 	context->state[0] = 0x67452301;  in SHA1Init()
117 	context->state[1] = 0xEFCDAB89;  in SHA1Init()
118 	context->state[2] = 0x98BADCFE;  in SHA1Init()
119 	context->state[3] = 0x10325476;  in SHA1Init()
120 	context->state[4] = 0xC3D2E1F0;  in SHA1Init()
133 	j = (size_t)((context->count >> 3) & 63);  in SHA1Update()
134 	context->count += ((u_int64_t)len << 3);  in SHA1Update()
136 		(void)memcpy(&context->buffer[j], data, (i = 64-j));  in SHA1Update()
137 		SHA1Transform(context->state, context->buffer);  in SHA1Update()
139 			SHA1Transform(context->state, (u_int8_t *)&data[i]);  in SHA1Update()
144 	(void)memcpy(&context->buffer[j], &data[i], len - i);  in SHA1Update()
159 		finalcount[i] = (u_int8_t)((context->count >>  in SHA1Pad()
160 		    ((7 - (i & 7)) * 8)) & 255);	/* Endian independent */  in SHA1Pad()
163 	while ((context->count & 504) != 448)  in SHA1Pad()
165 	SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */  in SHA1Pad()
177 		   ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);  in SHA1Final()