1 /* This file is part of the YAZ toolkit.
2 * Copyright (C) Index Data
3 * See the file LICENSE for details.
8 * \brief Implements SHA1 creation over WRBUF
19 #include <yaz/wrbuf.h>
23 By Steve Reid <steve@edmweb.com>
27 /* #define LITTLE_ENDIAN * This should be #define'd already, if true. */
28 /* #define SHA1HANDSOFF * Copies data before messing with it. */
38 unsigned char buffer[64];
41 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
43 /* blk0() and blk() perform the initial expand. */
44 /* I got the idea of expanding during the round function from SSLeay */
45 #if BYTE_ORDER == LITTLE_ENDIAN
46 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
47 |(rol(block->l[i],8)&0x00FF00FF))
48 #elif BYTE_ORDER == BIG_ENDIAN
49 #define blk0(i) block->l[i]
51 #error "Endianness not defined!"
53 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
54 ^block->l[(i+2)&15]^block->l[i&15],1))
56 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
57 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
58 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
59 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
60 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
61 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
64 /* Hash a single 512-bit block. This is the core of the algorithm. */
66 static void SHA1Transform(uint32_t state[5], const unsigned char buffer[64])
68 uint32_t a, b, c, d, e;
74 CHAR64LONG16 block[1]; /* use array to appear as a pointer */
75 memcpy(block, buffer, 64);
77 /* The following had better never be used because it causes the
78 * pointer-to-const buffer to be cast into a pointer to non-const.
79 * And the result is written through. I threw a "const" in, hoping
80 * this will cause a diagnostic.
82 CHAR64LONG16* block = (const CHAR64LONG16*)buffer;
84 /* Copy context->state[] to working vars */
90 /* 4 rounds of 20 operations each. Loop unrolled. */
91 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);
92 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);
93 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);
94 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);
95 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);
96 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);
97 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);
98 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);
99 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);
100 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);
101 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);
102 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);
103 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);
104 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);
105 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);
106 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);
107 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);
108 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);
109 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);
110 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);
111 /* Add the working vars back into context.state[] */
118 a = b = c = d = e = 0;
120 memset(block, '\0', sizeof(block));
125 /* SHA1Init - Initialize new context */
127 static void SHA1Init(SHA1_CTX* context)
129 /* SHA1 initialization constants */
130 context->state[0] = 0x67452301;
131 context->state[1] = 0xEFCDAB89;
132 context->state[2] = 0x98BADCFE;
133 context->state[3] = 0x10325476;
134 context->state[4] = 0xC3D2E1F0;
135 context->count[0] = context->count[1] = 0;
139 /* Run your data through this. */
141 static void SHA1Update(SHA1_CTX* context, const unsigned char* data, uint32_t len)
146 j = context->count[0];
147 if ((context->count[0] += len << 3) < j)
149 context->count[1] += (len>>29);
151 if ((j + len) > 63) {
152 memcpy(&context->buffer[j], data, (i = 64-j));
153 SHA1Transform(context->state, context->buffer);
154 for ( ; i + 63 < len; i += 64) {
155 SHA1Transform(context->state, &data[i]);
160 memcpy(&context->buffer[j], &data[i], len - i);
164 /* Add padding and return the message digest. */
166 static void SHA1Final(unsigned char digest[20], SHA1_CTX* context)
169 unsigned char finalcount[8];
172 for (i = 0; i < 8; i++) {
173 finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
174 >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */
177 SHA1Update(context, &c, 1);
178 while ((context->count[0] & 504) != 448) {
180 SHA1Update(context, &c, 1);
182 SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */
183 for (i = 0; i < 20; i++) {
184 digest[i] = (unsigned char)
185 ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
188 memset(context, '\0', sizeof(*context));
189 memset(&finalcount, '\0', sizeof(finalcount));
193 int wrbuf_sha1_write(WRBUF b, const char *cp, size_t sz, int hexit)
195 unsigned char digest[20];
199 SHA1Update(&ctx, (unsigned char *) cp, sz);
200 SHA1Final(digest, &ctx);
205 for (i = 0; i < 20; i++)
206 wrbuf_printf(b, "%02x", digest[i]);
209 wrbuf_write(b, (const char *) digest, 20);
213 int wrbuf_sha1_puts(WRBUF b, const char *cp, int hexit)
215 return wrbuf_sha1_write(b, cp, strlen(cp), hexit);
221 * c-file-style: "Stroustrup"
222 * indent-tabs-mode: nil
224 * vim: shiftwidth=4 tabstop=8 expandtab