cwist
Modern C web framework with libttak runtime
Loading...
Searching...
No Matches
sha256.h
Go to the documentation of this file.
1
13#ifndef __CWIST_CORE_CRYPTO_SHA256_H__
14#define __CWIST_CORE_CRYPTO_SHA256_H__
15
16#include <stddef.h>
17#include <stdint.h>
18#include <stdbool.h>
19#include <string.h>
20
21#define CWIST_SHA256_DIGEST_LEN 32
22
23typedef struct {
24 uint32_t state[8];
25 uint64_t bitlen;
26 uint8_t data[64];
27 size_t datalen;
29
30static inline uint32_t cwist_sha256_rotr(uint32_t x, uint32_t n) {
31 return (x >> n) | (x << (32 - n));
32}
33
34static inline void cwist_sha256_transform(cwist_sha256_ctx *ctx, const uint8_t *data) {
35 static const uint32_t k[64] = {
36 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4,
37 0xab1c5ed5, 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe,
38 0x9bdc06a7, 0xc19bf174, 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f,
39 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,
40 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc,
41 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, 0xa2bfe8a1, 0xa81a664b,
42 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070, 0x19a4c116,
43 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
44 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7,
45 0xc67178f2};
46 uint32_t m[64];
47 for (size_t i = 0; i < 16; i++) {
48 m[i] = ((uint32_t)data[i * 4] << 24) | ((uint32_t)data[i * 4 + 1] << 16) |
49 ((uint32_t)data[i * 4 + 2] << 8) | ((uint32_t)data[i * 4 + 3]);
50 }
51 for (size_t i = 16; i < 64; i++) {
52 uint32_t s0 = cwist_sha256_rotr(m[i - 15], 7) ^ cwist_sha256_rotr(m[i - 15], 18) ^
53 (m[i - 15] >> 3);
54 uint32_t s1 = cwist_sha256_rotr(m[i - 2], 17) ^ cwist_sha256_rotr(m[i - 2], 19) ^
55 (m[i - 2] >> 10);
56 m[i] = m[i - 16] + s0 + m[i - 7] + s1;
57 }
58 uint32_t a = ctx->state[0], b = ctx->state[1], c = ctx->state[2], d = ctx->state[3];
59 uint32_t e = ctx->state[4], f = ctx->state[5], g = ctx->state[6], h = ctx->state[7];
60 for (size_t i = 0; i < 64; i++) {
61 uint32_t s1 = cwist_sha256_rotr(e, 6) ^ cwist_sha256_rotr(e, 11) ^ cwist_sha256_rotr(e, 25);
62 uint32_t ch = (e & f) ^ (~e & g);
63 uint32_t t1 = h + s1 + ch + k[i] + m[i];
64 uint32_t s0 = cwist_sha256_rotr(a, 2) ^ cwist_sha256_rotr(a, 13) ^ cwist_sha256_rotr(a, 22);
65 uint32_t mj = (a & b) ^ (a & c) ^ (b & c);
66 uint32_t t2 = s0 + mj;
67 h = g;
68 g = f;
69 f = e;
70 e = d + t1;
71 d = c;
72 c = b;
73 b = a;
74 a = t1 + t2;
75 }
76 ctx->state[0] += a;
77 ctx->state[1] += b;
78 ctx->state[2] += c;
79 ctx->state[3] += d;
80 ctx->state[4] += e;
81 ctx->state[5] += f;
82 ctx->state[6] += g;
83 ctx->state[7] += h;
84}
85
86static inline void cwist_sha256_init(cwist_sha256_ctx *ctx) {
87 ctx->datalen = 0;
88 ctx->bitlen = 0;
89 ctx->state[0] = 0x6a09e667;
90 ctx->state[1] = 0xbb67ae85;
91 ctx->state[2] = 0x3c6ef372;
92 ctx->state[3] = 0xa54ff53a;
93 ctx->state[4] = 0x510e527f;
94 ctx->state[5] = 0x9b05688c;
95 ctx->state[6] = 0x1f83d9ab;
96 ctx->state[7] = 0x5be0cd19;
97}
98
99static inline void cwist_sha256_update(cwist_sha256_ctx *ctx, const uint8_t *data, size_t len) {
100 for (size_t i = 0; i < len; i++) {
101 ctx->data[ctx->datalen++] = data[i];
102 if (ctx->datalen == 64) {
103 cwist_sha256_transform(ctx, ctx->data);
104 ctx->bitlen += 512;
105 ctx->datalen = 0;
106 }
107 }
108}
109
110static inline void cwist_sha256_final(cwist_sha256_ctx *ctx, uint8_t out[CWIST_SHA256_DIGEST_LEN]) {
111 size_t i = ctx->datalen;
112
113 if (ctx->datalen < 56) {
114 ctx->data[i++] = 0x80;
115 while (i < 56) ctx->data[i++] = 0x00;
116 } else {
117 ctx->data[i++] = 0x80;
118 while (i < 64) ctx->data[i++] = 0x00;
119 cwist_sha256_transform(ctx, ctx->data);
120 memset(ctx->data, 0, 56);
121 }
122
123 ctx->bitlen += (uint64_t)ctx->datalen * 8;
124 /* The bit length goes into the last 8 bytes big-endian (FIPS 180-4
125 * section 5.1.1): the least significant byte ends up in data[63]. */
126 for (int j = 7; j >= 0; j--) ctx->data[63 - j] = (uint8_t)(ctx->bitlen >> (j * 8));
127 cwist_sha256_transform(ctx, ctx->data);
128
129 for (i = 0; i < 8; i++) {
130 out[i * 4] = (uint8_t)(ctx->state[i] >> 24);
131 out[i * 4 + 1] = (uint8_t)(ctx->state[i] >> 16);
132 out[i * 4 + 2] = (uint8_t)(ctx->state[i] >> 8);
133 out[i * 4 + 3] = (uint8_t)(ctx->state[i]);
134 }
135}
136
138static inline bool cwist_hmac_sha256(const uint8_t *key, size_t key_len, const uint8_t *msg,
139 size_t msg_len, uint8_t out[CWIST_SHA256_DIGEST_LEN]) {
140 uint8_t k[64];
141 memset(k, 0, sizeof(k));
142 if (key_len > 64) {
144 cwist_sha256_init(&c);
145 cwist_sha256_update(&c, key, key_len);
146 cwist_sha256_final(&c, k);
147 } else if (key_len > 0) {
148 memcpy(k, key, key_len);
149 }
150
151 uint8_t ipad[64], opad[64];
152 for (size_t i = 0; i < 64; i++) {
153 ipad[i] = k[i] ^ 0x36;
154 opad[i] = k[i] ^ 0x5c;
155 }
156
158 uint8_t inner[CWIST_SHA256_DIGEST_LEN];
159 cwist_sha256_init(&c);
160 cwist_sha256_update(&c, ipad, sizeof(ipad));
161 cwist_sha256_update(&c, msg, msg_len);
162 cwist_sha256_final(&c, inner);
163
164 cwist_sha256_init(&c);
165 cwist_sha256_update(&c, opad, sizeof(opad));
166 cwist_sha256_update(&c, inner, sizeof(inner));
167 cwist_sha256_final(&c, out);
168 return true;
169}
170
171#endif /* __CWIST_CORE_CRYPTO_SHA256_H__ */
#define CWIST_SHA256_DIGEST_LEN
Definition sha256.h:21
size_t datalen
Definition sha256.h:27
uint64_t bitlen
Definition sha256.h:25
uint8_t data[64]
Definition sha256.h:26
uint32_t state[8]
Definition sha256.h:24