1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
|
#ifndef __PSHA2_HPP_INCLUDED__
#define __PSHA2_HPP_INCLUDED__
#include <cstddef>
#include <cstdint>
struct PSHA2_256_Internal {
// https://github.com/983/SHA-256
// This is public domain implementation of SHA256
static inline uint32_t rotr(uint32_t x, int n) {
return (x >> n) | (x << (32 - n));
}
static inline uint32_t step1(uint32_t e, uint32_t f, uint32_t g) {
return (rotr(e, 6) ^ rotr(e, 11) ^ rotr(e, 25)) + ((e & f) ^ ((~ e) & g));
}
static inline uint32_t step2(uint32_t a, uint32_t b, uint32_t c) {
return (rotr(a, 2) ^ rotr(a, 13) ^ rotr(a, 22)) + ((a & b) ^ (a & c) ^ (b & c));
}
static inline void update_w(uint32_t *w, int i, const uint8_t *buffer) {
int j;
for(j = 0;j < 16;j++) {
if (i < 16) {
w[j] =
((uint32_t)buffer[0] << 24) |
((uint32_t)buffer[1] << 16) |
((uint32_t)buffer[2] << 8) |
((uint32_t)buffer[3]);
buffer += 4;
} else {
uint32_t a = w[(j + 1) & 15];
uint32_t b = w[(j + 14) & 15];
uint32_t s0 = (rotr(a, 7) ^ rotr(a, 18) ^ (a >> 3));
uint32_t s1 = (rotr(b, 17) ^ rotr(b, 19) ^ (b >> 10));
w[j] += w[(j + 9) & 15] + s0 + s1;
}
}
}
uint32_t state[8];
uint64_t n_bits;
uint8_t buffer_counter;
uint8_t buffer[64];
PSHA2_256_Internal() {
state[0] = 0x6a09e667;
state[1] = 0xbb67ae85;
state[2] = 0x3c6ef372;
state[3] = 0xa54ff53a;
state[4] = 0x510e527f;
state[5] = 0x9b05688c;
state[6] = 0x1f83d9ab;
state[7] = 0x5be0cd19;
n_bits = 0;
buffer_counter = 0;
for(int i=0;i<64;i++) buffer[i] = 0;
}
void block() {
static const uint32_t k[] = {
0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,
0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,
0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,
0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,
0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,
0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,
0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,
0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,
0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2,
};
uint32_t a = state[0];
uint32_t b = state[1];
uint32_t c = state[2];
uint32_t d = state[3];
uint32_t e = state[4];
uint32_t f = state[5];
uint32_t g = state[6];
uint32_t h = state[7];
uint32_t w[16] = {
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
};
for(int i = 0;i < 64;i += 16) {
update_w(w, i, buffer);
#if defined(__clang__)
#pragma clang loop unroll(full)
#endif
for(int j = 0;j < 16;j += 4) {
uint32_t temp;
temp = h + step1(e, f, g) + k[i + j + 0] + w[j + 0];
h = temp + d;
d = temp + step2(a, b, c);
temp = g + step1(h, e, f) + k[i + j + 1] + w[j + 1];
g = temp + c;
c = temp + step2(d, a, b);
temp = f + step1(g, h, e) + k[i + j + 2] + w[j + 2];
f = temp + b;
b = temp + step2(c, d, a);
temp = e + step1(f, g, h) + k[i + j + 3] + w[j + 3];
e = temp + a;
a = temp + step2(b, c, d);
}
}
state[0] += a;
state[1] += b;
state[2] += c;
state[3] += d;
state[4] += e;
state[5] += f;
state[6] += g;
state[7] += h;
}
void append_byte(uint8_t byte) {
buffer[buffer_counter++] = byte;
n_bits += 8;
if (buffer_counter == 64) {
buffer_counter = 0;
block();
}
}
void append(const void *src, size_t n_bytes) {
for(size_t i = 0;i < n_bytes;i++) {
append_byte(((const uint8_t*)src)[i]);
}
}
void appendWord(const void *src, size_t n_bytes) {
#if !defined(__BYTE_ORDER__) || (__BYTE_ORDER__ != __ORDER_BIG_ENDIAN__)
for(size_t i = 0;i < n_bytes;i++) {
append_byte(((const uint8_t*)src)[i]);
}
#else
for(int i = int(n_bytes)-1;i >= 0;i--) {
append_byte(((const uint8_t*)src)[i]);
}
#endif
}
void finalize() {
uint64_t nb = n_bits;
append_byte(0x80);
while(buffer_counter != 64 - 8) {
append_byte(0);
}
for(int i = 7;i >= 0;i--) {
uint8_t byte = (nb >> 8 * i) & 0xff;
append_byte(byte);
}
}
void finalize_bytes(void *dst_bytes32) {
uint8_t *ptr = (uint8_t*)dst_bytes32;
finalize();
for(int i = 0;i < 8;i++) {
for(int j = 3;j >= 0;j--) {
*ptr++ = (state[i] >> j * 8) & 0xff;
}
}
}
};
#endif // #ifndef __PSHA2_HPP_INCLUDED__
|