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