All Data Structures Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
sha1.c
Go to the documentation of this file.
1 /*
2  * SHA-1 in C
3  * By Steve Reid <steve@edmweb.com>
4  * 100% Public Domain
5  *
6  * Version: $Id: 59545bb6f5ec03778eec345d763d1685f0bb35cf $
7  */
8 
9 RCSID("$Id: 59545bb6f5ec03778eec345d763d1685f0bb35cf $")
10 
11 #include <freeradius-devel/libradius.h>
12 
13 #include "../include/sha1.h"
14 
15 #ifndef WITH_OPENSSL_SHA1
16 # define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
17 
18 /* blk0() and blk() perform the initial expand. */
19 /* I got the idea of expanding during the round function from SSLeay */
20 
21 # define blk0(i) (block->l[i] = htonl(block->l[i]))
22 
23 # define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
24  ^block->l[(i+2)&15]^block->l[i&15],1))
25 
26 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
27 # define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
28 # define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
29 # define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
30 # define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
31 # define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
32 
33 
34 /* Hash a single 512-bit block. This is the core of the algorithm. */
35 
36 void fr_sha1_transform(uint32_t state[5], uint8_t const buffer[64])
37 {
38  uint32_t a, b, c, d, e;
39  typedef union {
40  uint8_t c[64];
41  uint32_t l[16];
42  } CHAR64LONG16;
43  CHAR64LONG16 *block;
44  uint8_t workspace[64];
45 
46  block = (CHAR64LONG16*)workspace;
47  memcpy(block, buffer, 64);
48 
49  /* Copy context->state[] to working vars */
50  a = state[0];
51  b = state[1];
52  c = state[2];
53  d = state[3];
54  e = state[4];
55 
56  /* 4 rounds of 20 operations each. Loop unrolled. */
57  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);
58  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);
59  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);
60  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);
61  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);
62  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);
63  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);
64  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);
65  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);
66  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);
67  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);
68  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);
69  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);
70  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);
71  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);
72  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);
73  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);
74  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);
75  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);
76  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);
77 
78  /* Add the working vars back into context.state[] */
79  state[0] += a;
80  state[1] += b;
81  state[2] += c;
82  state[3] += d;
83  state[4] += e;
84 
85 # ifndef __clang_analyzer__
86  /* Wipe variables */
87  a = b = c = d = e = 0;
88 # endif
89 }
90 
91 
92 /* fr_sha1_init - Initialize new context */
93 
94 void fr_sha1_init(fr_sha1_ctx* context)
95 {
96  /* SHA1 initialization constants */
97  context->state[0] = 0x67452301;
98  context->state[1] = 0xEFCDAB89;
99  context->state[2] = 0x98BADCFE;
100  context->state[3] = 0x10325476;
101  context->state[4] = 0xC3D2E1F0;
102  context->count[0] = context->count[1] = 0;
103 }
104 
105 /* Run your data through this. */
106 void fr_sha1_update(fr_sha1_ctx *context,uint8_t const *data, size_t len)
107 {
108  unsigned int i, j;
109 
110  j = (context->count[0] >> 3) & 63;
111  if ((context->count[0] += len << 3) < (len << 3)) {
112  context->count[1]++;
113  }
114 
115  context->count[1] += (len >> 29);
116  if ((j + len) > 63) {
117  memcpy(&context->buffer[j], data, (i = 64-j));
118  fr_sha1_transform(context->state, context->buffer);
119  for ( ; i + 63 < len; i += 64) {
120  fr_sha1_transform(context->state, &data[i]);
121  }
122  j = 0;
123  } else {
124  i = 0;
125  }
126  memcpy(&context->buffer[j], &data[i], len - i);
127 }
128 
129 
130 /* Add padding and return the message digest. */
131 
132 void fr_sha1_final(uint8_t digest[20], fr_sha1_ctx *context)
133 {
134  uint32_t i, j;
135  uint8_t finalcount[8];
136 
137  for (i = 0; i < 8; i++) {
138  finalcount[i] = (uint8_t)((context->count[(i >= 4 ? 0 : 1)] >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */
139  }
140 
141  fr_sha1_update(context, (unsigned char const *) "\200", 1);
142 
143  while ((context->count[0] & 504) != 448) {
144  fr_sha1_update(context, (unsigned char const *) "\0", 1);
145  }
146  fr_sha1_update(context, finalcount, 8); /* Should cause a fr_sha1_transform() */
147  for (i = 0; i < 20; i++) {
148  digest[i] = (uint8_t)((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
149  }
150 
151 # ifndef __clang_analyzer__
152  /* Wipe variables */
153  i = j = 0;
154  memset(context->buffer, 0, 64);
155  memset(context->state, 0, 20);
156  memset(context->count, 0, 8);
157  memset(&finalcount, 0, 8);
158 # endif
159 
160 # ifdef SHA1HANDSOFF /* make fr_sha1_transform overwrite it's own static vars */
161  fr_sha1_transform(context->state, context->buffer);
162 # endif
163 }
164 
165 void fr_sha1_final_no_len(uint8_t digest[20], fr_sha1_ctx *context)
166 {
167  uint32_t i, j;
168 
169  for (i = 0; i < 20; i++) {
170  digest[i] = (uint8_t)((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
171  }
172 
173 # ifndef __clang_analyzer__
174  /* Wipe variables */
175  i = j = 0;
176  memset(context->buffer, 0, 64);
177  memset(context->state, 0, 20);
178  memset(context->count, 0, 8);
179 # endif
180 
181 # ifdef SHA1HANDSOFF /* make fr_sha1_transform overwrite it's own static vars */
182  fr_sha1_transform(context->state, context->buffer);
183 # endif
184 }
185 #endif
uint8_t buffer[64]
Definition: sha1.h:25
void fr_sha1_init(fr_sha1_ctx *context)
Definition: sha1.c:94
uint32_t state[5]
Definition: sha1.h:23
void fr_sha1_update(fr_sha1_ctx *context, uint8_t const *data, size_t len)
Definition: sha1.c:106
void fr_sha1_final(uint8_t digest[20], fr_sha1_ctx *context)
Definition: sha1.c:132
#define R1(v, w, x, y, z, i)
Definition: sha1.c:28
#define R2(v, w, x, y, z, i)
Definition: sha1.c:29
unsigned int state
Definition: proto_bfd.c:200
uint8_t data[]
Definition: eap_pwd.h:625
uint32_t count[2]
Definition: sha1.h:24
void fr_sha1_transform(uint32_t state[5], uint8_t const buffer[64])
Definition: sha1.c:36
#define R3(v, w, x, y, z, i)
Definition: sha1.c:30
#define RCSID(id)
Definition: build.h:135
#define R0(v, w, x, y, z, i)
Definition: sha1.c:27
void fr_sha1_final_no_len(uint8_t digest[20], fr_sha1_ctx *context)
Definition: sha1.c:165
#define R4(v, w, x, y, z, i)
Definition: sha1.c:31