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
183
184
185
186
187
188
189
190
191
192
193
|
/*
* SHA-{224,256}
* (C) 1999-2008 Jack Lloyd
* 2007 FlexSecure GmbH
*
* Distributed under the terms of the Botan license
*/
#include <botan/sha2_32.h>
#include <botan/loadstor.h>
#include <botan/rotate.h>
namespace Botan {
namespace {
/*
* SHA-256 Rho Function
*/
inline u32bit rho(u32bit X, u32bit rot1, u32bit rot2, u32bit rot3)
{
return (rotate_right(X, rot1) ^ rotate_right(X, rot2) ^
rotate_right(X, rot3));
}
/*
* SHA-256 Sigma Function
*/
inline u32bit sigma(u32bit X, u32bit rot1, u32bit rot2, u32bit shift)
{
return (rotate_right(X, rot1) ^ rotate_right(X, rot2) ^ (X >> shift));
}
/*
* SHA-256 F1 Function
*/
inline void F1(u32bit A, u32bit B, u32bit C, u32bit& D,
u32bit E, u32bit F, u32bit G, u32bit& H,
u32bit msg, u32bit magic)
{
magic += rho(E, 6, 11, 25) + ((E & F) ^ (~E & G)) + msg;
D += magic + H;
H += magic + rho(A, 2, 13, 22) + ((A & B) ^ (A & C) ^ (B & C));
}
}
/*
* SHA-256 Compression Function
*/
void SHA_224_256_BASE::compress_n(const byte input[], u32bit blocks)
{
u32bit A = digest[0], B = digest[1], C = digest[2],
D = digest[3], E = digest[4], F = digest[5],
G = digest[6], H = digest[7];
for(u32bit i = 0; i != blocks; ++i)
{
for(u32bit j = 0; j != 16; ++j)
W[j] = load_be<u32bit>(input, j);
input += HASH_BLOCK_SIZE;
for(u32bit j = 16; j != 64; ++j)
W[j] = sigma(W[j- 2], 17, 19, 10) + W[j- 7] +
sigma(W[j-15], 7, 18, 3) + W[j-16];
F1(A, B, C, D, E, F, G, H, W[ 0], 0x428A2F98);
F1(H, A, B, C, D, E, F, G, W[ 1], 0x71374491);
F1(G, H, A, B, C, D, E, F, W[ 2], 0xB5C0FBCF);
F1(F, G, H, A, B, C, D, E, W[ 3], 0xE9B5DBA5);
F1(E, F, G, H, A, B, C, D, W[ 4], 0x3956C25B);
F1(D, E, F, G, H, A, B, C, W[ 5], 0x59F111F1);
F1(C, D, E, F, G, H, A, B, W[ 6], 0x923F82A4);
F1(B, C, D, E, F, G, H, A, W[ 7], 0xAB1C5ED5);
F1(A, B, C, D, E, F, G, H, W[ 8], 0xD807AA98);
F1(H, A, B, C, D, E, F, G, W[ 9], 0x12835B01);
F1(G, H, A, B, C, D, E, F, W[10], 0x243185BE);
F1(F, G, H, A, B, C, D, E, W[11], 0x550C7DC3);
F1(E, F, G, H, A, B, C, D, W[12], 0x72BE5D74);
F1(D, E, F, G, H, A, B, C, W[13], 0x80DEB1FE);
F1(C, D, E, F, G, H, A, B, W[14], 0x9BDC06A7);
F1(B, C, D, E, F, G, H, A, W[15], 0xC19BF174);
F1(A, B, C, D, E, F, G, H, W[16], 0xE49B69C1);
F1(H, A, B, C, D, E, F, G, W[17], 0xEFBE4786);
F1(G, H, A, B, C, D, E, F, W[18], 0x0FC19DC6);
F1(F, G, H, A, B, C, D, E, W[19], 0x240CA1CC);
F1(E, F, G, H, A, B, C, D, W[20], 0x2DE92C6F);
F1(D, E, F, G, H, A, B, C, W[21], 0x4A7484AA);
F1(C, D, E, F, G, H, A, B, W[22], 0x5CB0A9DC);
F1(B, C, D, E, F, G, H, A, W[23], 0x76F988DA);
F1(A, B, C, D, E, F, G, H, W[24], 0x983E5152);
F1(H, A, B, C, D, E, F, G, W[25], 0xA831C66D);
F1(G, H, A, B, C, D, E, F, W[26], 0xB00327C8);
F1(F, G, H, A, B, C, D, E, W[27], 0xBF597FC7);
F1(E, F, G, H, A, B, C, D, W[28], 0xC6E00BF3);
F1(D, E, F, G, H, A, B, C, W[29], 0xD5A79147);
F1(C, D, E, F, G, H, A, B, W[30], 0x06CA6351);
F1(B, C, D, E, F, G, H, A, W[31], 0x14292967);
F1(A, B, C, D, E, F, G, H, W[32], 0x27B70A85);
F1(H, A, B, C, D, E, F, G, W[33], 0x2E1B2138);
F1(G, H, A, B, C, D, E, F, W[34], 0x4D2C6DFC);
F1(F, G, H, A, B, C, D, E, W[35], 0x53380D13);
F1(E, F, G, H, A, B, C, D, W[36], 0x650A7354);
F1(D, E, F, G, H, A, B, C, W[37], 0x766A0ABB);
F1(C, D, E, F, G, H, A, B, W[38], 0x81C2C92E);
F1(B, C, D, E, F, G, H, A, W[39], 0x92722C85);
F1(A, B, C, D, E, F, G, H, W[40], 0xA2BFE8A1);
F1(H, A, B, C, D, E, F, G, W[41], 0xA81A664B);
F1(G, H, A, B, C, D, E, F, W[42], 0xC24B8B70);
F1(F, G, H, A, B, C, D, E, W[43], 0xC76C51A3);
F1(E, F, G, H, A, B, C, D, W[44], 0xD192E819);
F1(D, E, F, G, H, A, B, C, W[45], 0xD6990624);
F1(C, D, E, F, G, H, A, B, W[46], 0xF40E3585);
F1(B, C, D, E, F, G, H, A, W[47], 0x106AA070);
F1(A, B, C, D, E, F, G, H, W[48], 0x19A4C116);
F1(H, A, B, C, D, E, F, G, W[49], 0x1E376C08);
F1(G, H, A, B, C, D, E, F, W[50], 0x2748774C);
F1(F, G, H, A, B, C, D, E, W[51], 0x34B0BCB5);
F1(E, F, G, H, A, B, C, D, W[52], 0x391C0CB3);
F1(D, E, F, G, H, A, B, C, W[53], 0x4ED8AA4A);
F1(C, D, E, F, G, H, A, B, W[54], 0x5B9CCA4F);
F1(B, C, D, E, F, G, H, A, W[55], 0x682E6FF3);
F1(A, B, C, D, E, F, G, H, W[56], 0x748F82EE);
F1(H, A, B, C, D, E, F, G, W[57], 0x78A5636F);
F1(G, H, A, B, C, D, E, F, W[58], 0x84C87814);
F1(F, G, H, A, B, C, D, E, W[59], 0x8CC70208);
F1(E, F, G, H, A, B, C, D, W[60], 0x90BEFFFA);
F1(D, E, F, G, H, A, B, C, W[61], 0xA4506CEB);
F1(C, D, E, F, G, H, A, B, W[62], 0xBEF9A3F7);
F1(B, C, D, E, F, G, H, A, W[63], 0xC67178F2);
A = (digest[0] += A);
B = (digest[1] += B);
C = (digest[2] += C);
D = (digest[3] += D);
E = (digest[4] += E);
F = (digest[5] += F);
G = (digest[6] += G);
H = (digest[7] += H);
}
}
/*
* Copy out the digest
*/
void SHA_224_256_BASE::copy_out(byte output[])
{
for(u32bit j = 0; j != OUTPUT_LENGTH; j += 4)
store_be(digest[j/4], output + j);
}
/*
* Clear memory of sensitive data
*/
void SHA_224_256_BASE::clear()
{
MDx_HashFunction::clear();
W.clear();
}
/*
* Clear memory of sensitive data
*/
void SHA_224::clear()
{
SHA_224_256_BASE::clear();
digest[0] = 0xc1059ed8;
digest[1] = 0x367cd507;
digest[2] = 0x3070dd17;
digest[3] = 0xf70e5939;
digest[4] = 0xffc00b31;
digest[5] = 0x68581511;
digest[6] = 0x64f98fa7;
digest[7] = 0xbefa4fa4;
}
/*
* Clear memory of sensitive data
*/
void SHA_256::clear()
{
SHA_224_256_BASE::clear();
digest[0] = 0x6A09E667;
digest[1] = 0xBB67AE85;
digest[2] = 0x3C6EF372;
digest[3] = 0xA54FF53A;
digest[4] = 0x510E527F;
digest[5] = 0x9B05688C;
digest[6] = 0x1F83D9AB;
digest[7] = 0x5BE0CD19;
}
}
|
