1 /* This file is part of the YAZ toolkit.
2 * Copyright (C) Index Data
3 * See the file LICENSE for details.
4 */
5
6 /**
7 * \file wrbuf_sha1.c
8 * \brief Implements SHA1 creation over WRBUF
9 */
10
11 #if HAVE_CONFIG_H
12 #include <config.h>
13 #endif
14
15 #include <stdio.h>
16 #include <stdlib.h>
17 #include <string.h>
18
19 #include <yaz/wrbuf.h>
20
21 /*
22 SHA-1 in C
23 By Steve Reid <steve@edmweb.com>
24 100% Public Domain
25 */
26
27 /* #define SHA1HANDSOFF * Copies data before messing with it. */
28
29 #define SHA1HANDSOFF
30
31 /* VS 2010 and later have stdint.h */
32 #if defined(_MSC_VER) && _MSC_VER < 1600
33 typedef unsigned int uint32_t;
34 #else
35 #include <stdint.h>
36 #endif
37
38 typedef struct {
39 uint32_t state[5];
40 uint32_t count[2];
41 unsigned char buffer[64];
42 } SHA1_CTX;
43
44 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
45
46 /* blk0() and blk() perform the initial expand. */
47 /* I got the idea of expanding during the round function from SSLeay */
48 #if WORDS_BIGENDIAN
49 #define blk0(i) block->l[i]
50 #else
51 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
52 |(rol(block->l[i],8)&0x00FF00FF))
53 #endif
54 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
55 ^block->l[(i+2)&15]^block->l[i&15],1))
56
57 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
58 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
59 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
60 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
61 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
62 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
63
64
65 /* Hash a single 512-bit block. This is the core of the algorithm. */
66
SHA1Transform(uint32_t state[5],const unsigned char buffer[64])67 static void SHA1Transform(uint32_t state[5], const unsigned char buffer[64])
68 {
69 uint32_t a, b, c, d, e;
70 typedef union {
71 unsigned char c[64];
72 uint32_t l[16];
73 } CHAR64LONG16;
74 #ifdef SHA1HANDSOFF
75 CHAR64LONG16 block[1]; /* use array to appear as a pointer */
76 memcpy(block, buffer, 64);
77 #else
78 /* The following had better never be used because it causes the
79 * pointer-to-const buffer to be cast into a pointer to non-const.
80 * And the result is written through. I threw a "const" in, hoping
81 * this will cause a diagnostic.
82 */
83 CHAR64LONG16* block = (const CHAR64LONG16*)buffer;
84 #endif
85 /* Copy context->state[] to working vars */
86 a = state[0];
87 b = state[1];
88 c = state[2];
89 d = state[3];
90 e = state[4];
91 /* 4 rounds of 20 operations each. Loop unrolled. */
92 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);
93 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);
94 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);
95 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);
96 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);
97 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);
98 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);
99 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);
100 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);
101 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);
102 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);
103 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);
104 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);
105 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);
106 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);
107 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);
108 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);
109 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);
110 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);
111 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);
112 /* Add the working vars back into context.state[] */
113 state[0] += a;
114 state[1] += b;
115 state[2] += c;
116 state[3] += d;
117 state[4] += e;
118 /* Wipe variables */
119 a = b = c = d = e = 0;
120 #ifdef SHA1HANDSOFF
121 memset(block, '\0', sizeof(block));
122 #endif
123 }
124
125
126 /* SHA1Init - Initialize new context */
127
SHA1Init(SHA1_CTX * context)128 static void SHA1Init(SHA1_CTX* context)
129 {
130 /* SHA1 initialization constants */
131 context->state[0] = 0x67452301;
132 context->state[1] = 0xEFCDAB89;
133 context->state[2] = 0x98BADCFE;
134 context->state[3] = 0x10325476;
135 context->state[4] = 0xC3D2E1F0;
136 context->count[0] = context->count[1] = 0;
137 }
138
139
140 /* Run your data through this. */
141
SHA1Update(SHA1_CTX * context,const unsigned char * data,uint32_t len)142 static void SHA1Update(SHA1_CTX* context, const unsigned char* data, uint32_t len)
143 {
144 uint32_t i;
145 uint32_t j;
146
147 j = context->count[0];
148 if ((context->count[0] += len << 3) < j)
149 context->count[1]++;
150 context->count[1] += (len>>29);
151 j = (j >> 3) & 63;
152 if ((j + len) > 63) {
153 memcpy(&context->buffer[j], data, (i = 64-j));
154 SHA1Transform(context->state, context->buffer);
155 for ( ; i + 63 < len; i += 64) {
156 SHA1Transform(context->state, &data[i]);
157 }
158 j = 0;
159 }
160 else i = 0;
161 memcpy(&context->buffer[j], &data[i], len - i);
162 }
163
164
165 /* Add padding and return the message digest. */
166
SHA1Final(unsigned char digest[20],SHA1_CTX * context)167 static void SHA1Final(unsigned char digest[20], SHA1_CTX* context)
168 {
169 unsigned i;
170 unsigned char finalcount[8];
171 unsigned char c;
172
173 for (i = 0; i < 8; i++) {
174 finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
175 >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */
176 }
177 c = 0200;
178 SHA1Update(context, &c, 1);
179 while ((context->count[0] & 504) != 448) {
180 c = 0000;
181 SHA1Update(context, &c, 1);
182 }
183 SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */
184 for (i = 0; i < 20; i++) {
185 digest[i] = (unsigned char)
186 ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
187 }
188 /* Wipe variables */
189 memset(context, '\0', sizeof(*context));
190 memset(&finalcount, '\0', sizeof(finalcount));
191 }
192
193
wrbuf_sha1_write(WRBUF b,const char * cp,size_t sz,int hexit)194 int wrbuf_sha1_write(WRBUF b, const char *cp, size_t sz, int hexit)
195 {
196 unsigned char digest[20];
197 SHA1_CTX ctx;
198
199 SHA1Init(&ctx);
200 SHA1Update(&ctx, (unsigned char *) cp, sz);
201 SHA1Final(digest, &ctx);
202
203 if (hexit)
204 {
205 int i;
206 for (i = 0; i < 20; i++)
207 wrbuf_printf(b, "%02x", digest[i]);
208 }
209 else
210 wrbuf_write(b, (const char *) digest, 20);
211 return 0;
212 }
213
wrbuf_sha1_puts(WRBUF b,const char * cp,int hexit)214 int wrbuf_sha1_puts(WRBUF b, const char *cp, int hexit)
215 {
216 return wrbuf_sha1_write(b, cp, strlen(cp), hexit);
217 }
218
219 /*
220 * Local variables:
221 * c-basic-offset: 4
222 * c-file-style: "Stroustrup"
223 * indent-tabs-mode: nil
224 * End:
225 * vim: shiftwidth=4 tabstop=8 expandtab
226 */
227