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