1825eb42bSJan Lentfer /*
2825eb42bSJan Lentfer * modified for ldns by Jelte Jansen, original taken from OpenBSD:
3825eb42bSJan Lentfer *
4825eb42bSJan Lentfer * SHA-1 in C
5825eb42bSJan Lentfer * By Steve Reid <steve@edmweb.com>
6825eb42bSJan Lentfer * 100% Public Domain
7825eb42bSJan Lentfer *
8825eb42bSJan Lentfer * Test Vectors (from FIPS PUB 180-1)
9825eb42bSJan Lentfer * "abc"
10825eb42bSJan Lentfer * A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
11825eb42bSJan Lentfer * "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
12825eb42bSJan Lentfer * 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
13825eb42bSJan Lentfer * A million repetitions of "a"
14825eb42bSJan Lentfer * 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
15825eb42bSJan Lentfer */
16825eb42bSJan Lentfer
17825eb42bSJan Lentfer /* #define LITTLE_ENDIAN * This should be #define'd already, if true. */
18825eb42bSJan Lentfer
19825eb42bSJan Lentfer #include <ldns/config.h>
20825eb42bSJan Lentfer #include <ldns/ldns.h>
21825eb42bSJan Lentfer #include <strings.h>
22825eb42bSJan Lentfer
235340022aSzrj #define SHA1HANDSOFF 1 /* Copies data before messing with it. */
24825eb42bSJan Lentfer #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
25825eb42bSJan Lentfer
26825eb42bSJan Lentfer /* blk0() and blk() perform the initial expand. */
27825eb42bSJan Lentfer /* I got the idea of expanding during the round function from SSLeay */
28825eb42bSJan Lentfer #if BYTE_ORDER == LITTLE_ENDIAN
29825eb42bSJan Lentfer #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
30825eb42bSJan Lentfer |(rol(block->l[i],8)&0x00FF00FF))
31825eb42bSJan Lentfer #else
32825eb42bSJan Lentfer #define blk0(i) block->l[i]
33825eb42bSJan Lentfer #endif
34825eb42bSJan Lentfer #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
35825eb42bSJan Lentfer ^block->l[(i+2)&15]^block->l[i&15],1))
36825eb42bSJan Lentfer
37825eb42bSJan Lentfer /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
38825eb42bSJan Lentfer #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
39825eb42bSJan Lentfer #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
40825eb42bSJan Lentfer #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
41825eb42bSJan Lentfer #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
42825eb42bSJan Lentfer #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
43825eb42bSJan Lentfer
44825eb42bSJan Lentfer /* Hash a single 512-bit block. This is the core of the algorithm. */
45825eb42bSJan Lentfer
46825eb42bSJan Lentfer void
ldns_sha1_transform(uint32_t state[5],const unsigned char buffer[LDNS_SHA1_BLOCK_LENGTH])47825eb42bSJan Lentfer ldns_sha1_transform(uint32_t state[5], const unsigned char buffer[LDNS_SHA1_BLOCK_LENGTH])
48825eb42bSJan Lentfer {
49825eb42bSJan Lentfer uint32_t a, b, c, d, e;
50825eb42bSJan Lentfer typedef union {
51825eb42bSJan Lentfer unsigned char c[64];
52825eb42bSJan Lentfer unsigned int l[16];
53825eb42bSJan Lentfer } CHAR64LONG16;
54825eb42bSJan Lentfer CHAR64LONG16* block;
55825eb42bSJan Lentfer #ifdef SHA1HANDSOFF
56825eb42bSJan Lentfer unsigned char workspace[LDNS_SHA1_BLOCK_LENGTH];
57825eb42bSJan Lentfer
58825eb42bSJan Lentfer block = (CHAR64LONG16 *)workspace;
59825eb42bSJan Lentfer memmove(block, buffer, LDNS_SHA1_BLOCK_LENGTH);
60825eb42bSJan Lentfer #else
61825eb42bSJan Lentfer block = (CHAR64LONG16 *)buffer;
62825eb42bSJan Lentfer #endif
63825eb42bSJan Lentfer /* Copy context->state[] to working vars */
64825eb42bSJan Lentfer a = state[0];
65825eb42bSJan Lentfer b = state[1];
66825eb42bSJan Lentfer c = state[2];
67825eb42bSJan Lentfer d = state[3];
68825eb42bSJan Lentfer e = state[4];
69825eb42bSJan Lentfer
70825eb42bSJan Lentfer /* 4 rounds of 20 operations each. Loop unrolled. */
71825eb42bSJan Lentfer 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);
72825eb42bSJan Lentfer 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);
73825eb42bSJan Lentfer 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);
74825eb42bSJan Lentfer 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);
75825eb42bSJan Lentfer 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);
76825eb42bSJan Lentfer 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);
77825eb42bSJan Lentfer 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);
78825eb42bSJan Lentfer 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);
79825eb42bSJan Lentfer 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);
80825eb42bSJan Lentfer 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);
81825eb42bSJan Lentfer 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);
82825eb42bSJan Lentfer 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);
83825eb42bSJan Lentfer 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);
84825eb42bSJan Lentfer 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);
85825eb42bSJan Lentfer 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);
86825eb42bSJan Lentfer 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);
87825eb42bSJan Lentfer 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);
88825eb42bSJan Lentfer 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);
89825eb42bSJan Lentfer 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);
90825eb42bSJan Lentfer 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);
91825eb42bSJan Lentfer
92825eb42bSJan Lentfer /* Add the working vars back into context.state[] */
93825eb42bSJan Lentfer state[0] += a;
94825eb42bSJan Lentfer state[1] += b;
95825eb42bSJan Lentfer state[2] += c;
96825eb42bSJan Lentfer state[3] += d;
97825eb42bSJan Lentfer state[4] += e;
98825eb42bSJan Lentfer /* Wipe variables */
99825eb42bSJan Lentfer a = b = c = d = e = 0;
100819dec71SDaniel Fojt (void)a;
101825eb42bSJan Lentfer }
102825eb42bSJan Lentfer
103825eb42bSJan Lentfer
104825eb42bSJan Lentfer /* SHA1Init - Initialize new context */
105825eb42bSJan Lentfer
106825eb42bSJan Lentfer void
ldns_sha1_init(ldns_sha1_ctx * context)107825eb42bSJan Lentfer ldns_sha1_init(ldns_sha1_ctx *context)
108825eb42bSJan Lentfer {
109825eb42bSJan Lentfer /* SHA1 initialization constants */
110825eb42bSJan Lentfer context->count = 0;
111825eb42bSJan Lentfer context->state[0] = 0x67452301;
112825eb42bSJan Lentfer context->state[1] = 0xEFCDAB89;
113825eb42bSJan Lentfer context->state[2] = 0x98BADCFE;
114825eb42bSJan Lentfer context->state[3] = 0x10325476;
115825eb42bSJan Lentfer context->state[4] = 0xC3D2E1F0;
116825eb42bSJan Lentfer }
117825eb42bSJan Lentfer
118825eb42bSJan Lentfer
119825eb42bSJan Lentfer /* Run your data through this. */
120825eb42bSJan Lentfer
121825eb42bSJan Lentfer void
ldns_sha1_update(ldns_sha1_ctx * context,const unsigned char * data,unsigned int len)122825eb42bSJan Lentfer ldns_sha1_update(ldns_sha1_ctx *context, const unsigned char *data, unsigned int len)
123825eb42bSJan Lentfer {
124825eb42bSJan Lentfer unsigned int i;
125825eb42bSJan Lentfer unsigned int j;
126825eb42bSJan Lentfer
127fd185f4dSJan Lentfer j = (unsigned)(uint32_t)((context->count >> 3) & 63);
128825eb42bSJan Lentfer context->count += (len << 3);
129825eb42bSJan Lentfer if ((j + len) > 63) {
130825eb42bSJan Lentfer memmove(&context->buffer[j], data, (i = 64 - j));
131825eb42bSJan Lentfer ldns_sha1_transform(context->state, context->buffer);
132825eb42bSJan Lentfer for ( ; i + 63 < len; i += 64) {
133825eb42bSJan Lentfer ldns_sha1_transform(context->state, &data[i]);
134825eb42bSJan Lentfer }
135825eb42bSJan Lentfer j = 0;
136825eb42bSJan Lentfer }
137825eb42bSJan Lentfer else i = 0;
138825eb42bSJan Lentfer memmove(&context->buffer[j], &data[i], len - i);
139825eb42bSJan Lentfer }
140825eb42bSJan Lentfer
141825eb42bSJan Lentfer
142825eb42bSJan Lentfer /* Add padding and return the message digest. */
143825eb42bSJan Lentfer
144825eb42bSJan Lentfer void
ldns_sha1_final(unsigned char digest[LDNS_SHA1_DIGEST_LENGTH],ldns_sha1_ctx * context)145825eb42bSJan Lentfer ldns_sha1_final(unsigned char digest[LDNS_SHA1_DIGEST_LENGTH], ldns_sha1_ctx *context)
146825eb42bSJan Lentfer {
147825eb42bSJan Lentfer unsigned int i;
148825eb42bSJan Lentfer unsigned char finalcount[8];
149825eb42bSJan Lentfer
150825eb42bSJan Lentfer for (i = 0; i < 8; i++) {
151825eb42bSJan Lentfer finalcount[i] = (unsigned char)((context->count >>
152825eb42bSJan Lentfer ((7 - (i & 7)) * 8)) & 255); /* Endian independent */
153825eb42bSJan Lentfer }
154825eb42bSJan Lentfer ldns_sha1_update(context, (unsigned char *)"\200", 1);
155825eb42bSJan Lentfer while ((context->count & 504) != 448) {
156825eb42bSJan Lentfer ldns_sha1_update(context, (unsigned char *)"\0", 1);
157825eb42bSJan Lentfer }
158825eb42bSJan Lentfer ldns_sha1_update(context, finalcount, 8); /* Should cause a SHA1Transform() */
159825eb42bSJan Lentfer
160fd185f4dSJan Lentfer if (digest != NULL)
161825eb42bSJan Lentfer for (i = 0; i < LDNS_SHA1_DIGEST_LENGTH; i++) {
162825eb42bSJan Lentfer digest[i] = (unsigned char)((context->state[i >> 2] >>
163825eb42bSJan Lentfer ((3 - (i & 3)) * 8)) & 255);
164825eb42bSJan Lentfer }
165825eb42bSJan Lentfer #ifdef SHA1HANDSOFF /* make SHA1Transform overwrite its own static vars */
166825eb42bSJan Lentfer ldns_sha1_transform(context->state, context->buffer);
167825eb42bSJan Lentfer #endif
168825eb42bSJan Lentfer }
169825eb42bSJan Lentfer
170825eb42bSJan Lentfer unsigned char *
ldns_sha1(const unsigned char * data,unsigned int data_len,unsigned char * digest)171*ee791febSAntonio Huete Jimenez ldns_sha1(const unsigned char *data, unsigned int data_len, unsigned char *digest)
172825eb42bSJan Lentfer {
173825eb42bSJan Lentfer ldns_sha1_ctx ctx;
174825eb42bSJan Lentfer ldns_sha1_init(&ctx);
175825eb42bSJan Lentfer ldns_sha1_update(&ctx, data, data_len);
176825eb42bSJan Lentfer ldns_sha1_final(digest, &ctx);
177825eb42bSJan Lentfer return digest;
178825eb42bSJan Lentfer }
179