1 /*
2 SHA-1 in C
3 By Steve Reid <steve@edmweb.com>
4 100% Public Domain
5
6 small edits for cado-nfs by E. Thomé. Still PD.
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 LITTLE_ENDIAN * This should be #define'd already, if true. */
18
19 #include "cado.h" // IWYU pragma: keep
20 #include <string.h>
21 #include <stdint.h> /* for uint32_t */
22
23 #include "sha1.h"
24
25 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
26
27 /* blk0() and blk() perform the initial expand. */
28 /* I got the idea of expanding during the round function from SSLeay */
29 #if BYTE_ORDER == LITTLE_ENDIAN
30 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
31 |(rol(block->l[i],8)&0x00FF00FF))
32 #elif BYTE_ORDER == BIG_ENDIAN
33 #define blk0(i) block->l[i]
34 #else
35 #error "Endianness not defined!"
36 #endif
37 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
38 ^block->l[(i+2)&15]^block->l[i&15],1))
39
40 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
41 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
42 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
43 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
44 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
45 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
46
47
48 /* Hash a single 512-bit block. This is the core of the algorithm. */
49
SHA1Transform(uint32_t state[5],const unsigned char buffer[64])50 void SHA1Transform(uint32_t state[5], const unsigned char buffer[64])
51 {
52 uint32_t a, b, c, d, e;
53
54 union {
55 unsigned char c[64];
56 uint32_t l[16];
57 } block[1]; /* use array to appear as a pointer */
58
59 memcpy(block, buffer, 64);
60
61 /* Copy context->state[] to working vars */
62 a = state[0];
63 b = state[1];
64 c = state[2];
65 d = state[3];
66 e = state[4];
67 /* 4 rounds of 20 operations each. Loop unrolled. */
68 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);
69 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);
70 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);
71 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);
72 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);
73 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);
74 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);
75 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);
76 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);
77 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);
78 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);
79 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);
80 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);
81 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);
82 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);
83 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);
84 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);
85 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);
86 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);
87 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);
88 /* Add the working vars back into context.state[] */
89 state[0] += a;
90 state[1] += b;
91 state[2] += c;
92 state[3] += d;
93 state[4] += e;
94 /* Wipe variables */
95 memset(block, 0, sizeof(block));
96 a=b=c=d=e=0;
97 }
98
99
100 /* SHA1Init - Initialize new context */
101
SHA1Init(SHA1_CTX * context)102 void SHA1Init(SHA1_CTX * context)
103 {
104 /* SHA1 initialization constants */
105 context->state[0] = 0x67452301;
106 context->state[1] = 0xEFCDAB89;
107 context->state[2] = 0x98BADCFE;
108 context->state[3] = 0x10325476;
109 context->state[4] = 0xC3D2E1F0;
110 context->count[0] = context->count[1] = 0;
111 }
112
113 /* Run your data through this. */
114
SHA1Update(SHA1_CTX * context,const unsigned char * data,uint32_t len)115 void SHA1Update(SHA1_CTX * context, const unsigned char *data, uint32_t len)
116 {
117 uint32_t i;
118 uint32_t j;
119
120 j = context->count[0];
121 if ((context->count[0] += len << 3) < j)
122 context->count[1]++;
123 context->count[1] += (len >> 29);
124 j = (j >> 3) & 63;
125 if ((j + len) > 63) {
126 memcpy(&context->buffer[j], data, (i = 64 - j));
127 SHA1Transform(context->state, context->buffer);
128 for (; i + 63 < len; i += 64) {
129 SHA1Transform(context->state, &data[i]);
130 }
131 j = 0;
132 } else {
133 i = 0;
134 }
135 memcpy(&context->buffer[j], &data[i], len - i);
136 }
137
138
139 /* Add padding and return the message digest. */
140
SHA1Final(unsigned char digest[20],SHA1_CTX * context)141 void SHA1Final(unsigned char digest[20], SHA1_CTX * context)
142 {
143 unsigned i;
144 unsigned char finalcount[8];
145 unsigned char c;
146
147 for (i = 0; i < 8; i++) {
148 finalcount[i] = (unsigned char) ((context->count[(i >= 4 ? 0 : 1)] >> ((3 - (i & 3)) * 8)) & 255); /* Endian independent */
149 }
150 c = 0200;
151 SHA1Update(context, &c, 1);
152 while ((context->count[0] & 504) != 448) {
153 c = 0000;
154 SHA1Update(context, &c, 1);
155 }
156 SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */
157 for (i = 0; i < 20; i++) {
158 digest[i] = (unsigned char)
159 ((context->state[i >> 2] >> ((3 - (i & 3)) * 8)) & 255);
160 }
161 /* Wipe variables */
162 memset(context, '\0', sizeof(*context));
163 memset(&finalcount, '\0', sizeof(finalcount));
164 }
165
SHA1(char * hash_out,const char * str,int len)166 void SHA1(char *hash_out, const char *str, int len)
167 {
168 SHA1_CTX ctx;
169 SHA1Init(&ctx);
170 SHA1Update(&ctx, (const unsigned char *) str, len);
171 SHA1Final((unsigned char *) hash_out, &ctx);
172 hash_out[20] = '\0';
173 }
174