summaryrefslogtreecommitdiffstats
path: root/3rd_party/libsrp6a-sha512/t_sha.c
diff options
context:
space:
mode:
Diffstat (limited to '3rd_party/libsrp6a-sha512/t_sha.c')
-rw-r--r--3rd_party/libsrp6a-sha512/t_sha.c314
1 files changed, 314 insertions, 0 deletions
diff --git a/3rd_party/libsrp6a-sha512/t_sha.c b/3rd_party/libsrp6a-sha512/t_sha.c
new file mode 100644
index 0000000..8e54cb6
--- /dev/null
+++ b/3rd_party/libsrp6a-sha512/t_sha.c
@@ -0,0 +1,314 @@
1#include "t_defines.h"
2#include "t_sha.h"
3
4#ifdef CRYPTOLIB_SHA
5
6/* A wrapper around CryptoLib's shsFinal that delivers output in octets */
7void
8shsFinalBytes(unsigned char digest[20], SHS_CTX* context)
9{
10 int i;
11 unsigned long r;
12 unsigned char *p = digest;
13
14 shsFinal(context);
15 for(i = 0; i < 5; ++i) {
16 r = context->h[i];
17 *p++ = (unsigned char)((r >> 24) & 0xff);
18 *p++ = (unsigned char)((r >> 16) & 0xff);
19 *p++ = (unsigned char)((r >> 8) & 0xff);
20 *p++ = (unsigned char)(r & 0xff);
21 }
22}
23
24#elif defined(GCRYPT_SHA)
25/* Wrappers for gcrypt's md interface */
26
27void
28SHA1Init_gcry(SHA1_CTX * ctx)
29{
30 gcry_md_open(ctx, GCRY_MD_SHA1, 0);
31}
32
33void
34SHA1Update_gcry(SHA1_CTX * ctx, const void *data, unsigned int len)
35{
36 gcry_md_write(*ctx, data, len);
37}
38
39void
40SHA1Final_gcry(unsigned char digest[20], SHA1_CTX * ctx)
41{
42 memcpy(digest, gcry_md_read(*ctx, GCRY_MD_SHA1), 20);
43 gcry_md_close(*ctx);
44}
45
46void
47SHA512Init_gcry(SHA512_CTX * ctx)
48{
49 gcry_md_open(ctx, GCRY_MD_SHA512, 0);
50}
51
52void
53SHA512Update_gcry(SHA512_CTX * ctx, const void *data, unsigned int len)
54{
55 gcry_md_write(*ctx, data, len);
56}
57
58void
59SHA512Final_gcry(unsigned char digest[64], SHA512_CTX * ctx)
60{
61 memcpy(digest, gcry_md_read(*ctx, GCRY_MD_SHA512), 64);
62 gcry_md_close(*ctx);
63}
64
65#elif defined(MBEDTLS_SHA)
66/* Wrappers for mbedtls's md interface */
67
68void
69SHA1Init_mbed(SHA1_CTX * ctx)
70{
71 mbedtls_md_init(ctx);
72 mbedtls_md_setup(ctx, mbedtls_md_info_from_type(MBEDTLS_MD_SHA1), 0);
73 mbedtls_md_starts(ctx);
74}
75
76void
77SHA1Update_mbed(SHA1_CTX * ctx, const void *data, unsigned int len)
78{
79 mbedtls_md_update(ctx, data, len);
80}
81
82void
83SHA1Final_mbed(unsigned char digest[20], SHA1_CTX * ctx)
84{
85 mbedtls_md_finish(ctx, digest);
86 mbedtls_md_free(ctx);
87}
88
89void
90SHA512Init_mbed(SHA512_CTX * ctx)
91{
92 mbedtls_md_init(ctx);
93 mbedtls_md_setup(ctx, mbedtls_md_info_from_type(MBEDTLS_MD_SHA512), 0);
94 mbedtls_md_starts(ctx);
95}
96
97void
98SHA512Update_mbed(SHA512_CTX * ctx, const void *data, unsigned int len)
99{
100 mbedtls_md_update(ctx, data, len);
101}
102
103void
104SHA512Final_mbed(unsigned char digest[64], SHA512_CTX * ctx)
105{
106 mbedtls_md_finish(ctx, digest);
107 mbedtls_md_free(ctx);
108}
109
110#elif defined(OPENSSL_SHA)
111#if OPENSSL_VERSION_NUMBER >= 0x30000000L
112void
113SHA1Init_openssl(SHA1_CTX *ctx)
114{
115 *ctx = EVP_MD_CTX_new();
116 EVP_DigestInit(*ctx, EVP_sha1());
117}
118
119void SHA1Update_openssl(SHA1_CTX *ctx, const void *data, unsigned int len)
120{
121 EVP_DigestUpdate(*ctx, data, (size_t)len);
122}
123
124void SHA1Final_openssl(unsigned char digest[20], SHA1_CTX *ctx)
125{
126 EVP_DigestFinal(*ctx, digest, NULL);
127 EVP_MD_CTX_destroy(*ctx);
128}
129
130void
131SHA512Init_openssl(SHA512_CTX *ctx)
132{
133 *ctx = EVP_MD_CTX_new();
134 EVP_DigestInit(*ctx, EVP_sha512());
135}
136
137void SHA512Update_openssl(SHA512_CTX *ctx, const void *data, unsigned int len)
138{
139 EVP_DigestUpdate(*ctx, data, (size_t)len);
140}
141
142void SHA512Final_openssl(unsigned char digest[64], SHA512_CTX *ctx)
143{
144 EVP_DigestFinal(*ctx, digest, NULL);
145 EVP_MD_CTX_destroy(*ctx);
146}
147#endif
148#elif !defined(OPENSSL_SHA) && !defined(TOMCRYPT_SHA)
149/* Use the free SHA1 if the library doesn't have it */
150
151/*
152SHA-1 in C
153By Steve Reid <steve@edmweb.com>
154100% Public Domain
155
156Test Vectors (from FIPS PUB 180-1)
157"abc"
158 A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
159"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
160 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
161A million repetitions of "a"
162 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
163*/
164
165/* #define LITTLE_ENDIAN * This should be #define'd if true. */
166/* #define SHA1HANDSOFF * Copies data before messing with it. */
167
168#include <stdio.h>
169#include <string.h>
170
171static void SHA1Transform(uint32 state[5], const unsigned char buffer[64]);
172
173#define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
174
175/* blk0() and blk() perform the initial expand. */
176/* I got the idea of expanding during the round function from SSLeay */
177#ifndef WORDS_BIGENDIAN
178#define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
179 |(rol(block->l[i],8)&0x00FF00FF))
180#else
181#define blk0(i) block->l[i]
182#endif
183#define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
184 ^block->l[(i+2)&15]^block->l[i&15],1))
185
186/* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
187#define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
188#define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
189#define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
190#define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
191#define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
192
193/* Hash a single 512-bit block. This is the core of the algorithm. */
194
195static void SHA1Transform(uint32 state[5], const unsigned char buffer[64])
196{
197uint32 a, b, c, d, e;
198typedef union {
199 unsigned char c[64];
200 uint32 l[16];
201} CHAR64LONG16;
202CHAR64LONG16* block;
203#ifdef SHA1HANDSOFF
204static unsigned char workspace[64];
205 block = (CHAR64LONG16*)workspace;
206 memcpy(block, buffer, 64);
207#else
208 block = (CHAR64LONG16*)buffer;
209#endif
210 /* Copy context->state[] to working vars */
211 a = state[0];
212 b = state[1];
213 c = state[2];
214 d = state[3];
215 e = state[4];
216 /* 4 rounds of 20 operations each. Loop unrolled. */
217 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);
218 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);
219 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);
220 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);
221 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);
222 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);
223 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);
224 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);
225 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);
226 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);
227 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);
228 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);
229 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);
230 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);
231 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);
232 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);
233 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);
234 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);
235 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);
236 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);
237 /* Add the working vars back into context.state[] */
238 state[0] += a;
239 state[1] += b;
240 state[2] += c;
241 state[3] += d;
242 state[4] += e;
243 /* Wipe variables */
244 a = b = c = d = e = 0;
245}
246
247
248/* SHA1Init - Initialize new context */
249
250void SHA1Init(SHA1_CTX* context)
251{
252 /* SHA1 initialization constants */
253 context->state[0] = 0x67452301;
254 context->state[1] = 0xEFCDAB89;
255 context->state[2] = 0x98BADCFE;
256 context->state[3] = 0x10325476;
257 context->state[4] = 0xC3D2E1F0;
258 context->count[0] = context->count[1] = 0;
259}
260
261
262/* Run your data through this. */
263
264void SHA1Update(SHA1_CTX* context, const unsigned char* data, unsigned int len)
265{
266unsigned int i, j;
267
268 j = (context->count[0] >> 3) & 63;
269 if ((context->count[0] += len << 3) < (len << 3)) context->count[1]++;
270 context->count[1] += (len >> 29);
271 if ((j + len) > 63) {
272 memcpy(&context->buffer[j], data, (i = 64-j));
273 SHA1Transform(context->state, context->buffer);
274 for ( ; i + 63 < len; i += 64) {
275 SHA1Transform(context->state, &data[i]);
276 }
277 j = 0;
278 }
279 else i = 0;
280 memcpy(&context->buffer[j], &data[i], len - i);
281}
282
283
284/* Add padding and return the message digest. */
285
286void SHA1Final(unsigned char digest[20], SHA1_CTX* context)
287{
288uint32 i, j;
289unsigned char finalcount[8];
290
291 for (i = 0; i < 8; i++) {
292 finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
293 >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */
294 }
295 SHA1Update(context, (unsigned char *)"\200", 1);
296 while ((context->count[0] & 504) != 448) {
297 SHA1Update(context, (unsigned char *)"\0", 1);
298 }
299 SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */
300 for (i = 0; i < 20; i++) {
301 digest[i] = (unsigned char)
302 ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
303 }
304 /* Wipe variables */
305 i = j = 0;
306 memset(context->buffer, 0, 64);
307 memset(context->state, 0, 20);
308 memset(context->count, 0, 8);
309 memset(&finalcount, 0, 8);
310#ifdef SHA1HANDSOFF /* make SHA1Transform overwrite it's own static vars */
311 SHA1Transform(context->state, context->buffer);
312#endif
313}
314#endif