Botan 1.10.17
sha2_32.cpp
Go to the documentation of this file.
1/*
2* SHA-{224,256}
3* (C) 1999-2010 Jack Lloyd
4* 2007 FlexSecure GmbH
5*
6* Distributed under the terms of the Botan license
7*/
8
9#include <botan/sha2_32.h>
10#include <botan/loadstor.h>
11#include <botan/rotate.h>
12
13namespace Botan {
14
15namespace {
16
17namespace SHA2_32 {
18
19/*
20* SHA-256 Rho Function
21*/
22inline u32bit rho(u32bit X, u32bit rot1, u32bit rot2, u32bit rot3)
23 {
24 return (rotate_right(X, rot1) ^ rotate_right(X, rot2) ^
25 rotate_right(X, rot3));
26 }
27
28/*
29* SHA-256 Sigma Function
30*/
31inline u32bit sigma(u32bit X, u32bit rot1, u32bit rot2, u32bit shift)
32 {
33 return (rotate_right(X, rot1) ^ rotate_right(X, rot2) ^ (X >> shift));
34 }
35
36/*
37* SHA-256 F1 Function
38*
39* Use a macro as many compilers won't inline a function this big,
40* even though it is much faster if inlined.
41*/
42#define SHA2_32_F(A, B, C, D, E, F, G, H, M1, M2, M3, M4, magic) \
43 do { \
44 H += magic + rho(E, 6, 11, 25) + ((E & F) ^ (~E & G)) + M1; \
45 D += H; \
46 H += rho(A, 2, 13, 22) + ((A & B) | ((A | B) & C)); \
47 M1 += sigma(M2, 17, 19, 10) + M3 + sigma(M4, 7, 18, 3); \
48 } while(0);
49
50/*
51* SHA-224 / SHA-256 compression function
52*/
53void compress(MemoryRegion<u32bit>& digest,
54 const byte input[], size_t blocks)
55 {
56 u32bit A = digest[0], B = digest[1], C = digest[2],
57 D = digest[3], E = digest[4], F = digest[5],
58 G = digest[6], H = digest[7];
59
60 for(size_t i = 0; i != blocks; ++i)
61 {
62 u32bit W00 = load_be<u32bit>(input, 0);
63 u32bit W01 = load_be<u32bit>(input, 1);
64 u32bit W02 = load_be<u32bit>(input, 2);
65 u32bit W03 = load_be<u32bit>(input, 3);
66 u32bit W04 = load_be<u32bit>(input, 4);
67 u32bit W05 = load_be<u32bit>(input, 5);
68 u32bit W06 = load_be<u32bit>(input, 6);
69 u32bit W07 = load_be<u32bit>(input, 7);
70 u32bit W08 = load_be<u32bit>(input, 8);
71 u32bit W09 = load_be<u32bit>(input, 9);
72 u32bit W10 = load_be<u32bit>(input, 10);
73 u32bit W11 = load_be<u32bit>(input, 11);
74 u32bit W12 = load_be<u32bit>(input, 12);
75 u32bit W13 = load_be<u32bit>(input, 13);
76 u32bit W14 = load_be<u32bit>(input, 14);
77 u32bit W15 = load_be<u32bit>(input, 15);
78
79 SHA2_32_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x428A2F98);
80 SHA2_32_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x71374491);
81 SHA2_32_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0xB5C0FBCF);
82 SHA2_32_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0xE9B5DBA5);
83 SHA2_32_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x3956C25B);
84 SHA2_32_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x59F111F1);
85 SHA2_32_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x923F82A4);
86 SHA2_32_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0xAB1C5ED5);
87 SHA2_32_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0xD807AA98);
88 SHA2_32_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0x12835B01);
89 SHA2_32_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0x243185BE);
90 SHA2_32_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0x550C7DC3);
91 SHA2_32_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0x72BE5D74);
92 SHA2_32_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0x80DEB1FE);
93 SHA2_32_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0x9BDC06A7);
94 SHA2_32_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0xC19BF174);
95 SHA2_32_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0xE49B69C1);
96 SHA2_32_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0xEFBE4786);
97 SHA2_32_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x0FC19DC6);
98 SHA2_32_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x240CA1CC);
99 SHA2_32_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x2DE92C6F);
100 SHA2_32_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x4A7484AA);
101 SHA2_32_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x5CB0A9DC);
102 SHA2_32_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x76F988DA);
103 SHA2_32_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0x983E5152);
104 SHA2_32_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0xA831C66D);
105 SHA2_32_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0xB00327C8);
106 SHA2_32_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0xBF597FC7);
107 SHA2_32_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0xC6E00BF3);
108 SHA2_32_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xD5A79147);
109 SHA2_32_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0x06CA6351);
110 SHA2_32_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0x14292967);
111 SHA2_32_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x27B70A85);
112 SHA2_32_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x2E1B2138);
113 SHA2_32_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x4D2C6DFC);
114 SHA2_32_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x53380D13);
115 SHA2_32_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x650A7354);
116 SHA2_32_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x766A0ABB);
117 SHA2_32_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x81C2C92E);
118 SHA2_32_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x92722C85);
119 SHA2_32_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0xA2BFE8A1);
120 SHA2_32_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0xA81A664B);
121 SHA2_32_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0xC24B8B70);
122 SHA2_32_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0xC76C51A3);
123 SHA2_32_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0xD192E819);
124 SHA2_32_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xD6990624);
125 SHA2_32_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0xF40E3585);
126 SHA2_32_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0x106AA070);
127 SHA2_32_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x19A4C116);
128 SHA2_32_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x1E376C08);
129 SHA2_32_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x2748774C);
130 SHA2_32_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x34B0BCB5);
131 SHA2_32_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x391C0CB3);
132 SHA2_32_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x4ED8AA4A);
133 SHA2_32_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x5B9CCA4F);
134 SHA2_32_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x682E6FF3);
135 SHA2_32_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0x748F82EE);
136 SHA2_32_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0x78A5636F);
137 SHA2_32_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0x84C87814);
138 SHA2_32_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0x8CC70208);
139 SHA2_32_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0x90BEFFFA);
140 SHA2_32_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xA4506CEB);
141 SHA2_32_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0xBEF9A3F7);
142 SHA2_32_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0xC67178F2);
143
144 A = (digest[0] += A);
145 B = (digest[1] += B);
146 C = (digest[2] += C);
147 D = (digest[3] += D);
148 E = (digest[4] += E);
149 F = (digest[5] += F);
150 G = (digest[6] += G);
151 H = (digest[7] += H);
152
153 input += 64;
154 }
155 }
156
157}
158
159}
160
161/*
162* SHA-224 compression function
163*/
164void SHA_224::compress_n(const byte input[], size_t blocks)
165 {
166 SHA2_32::compress(digest, input, blocks);
167 }
168
169/*
170* Copy out the digest
171*/
172void SHA_224::copy_out(byte output[])
173 {
174 for(size_t i = 0; i != output_length(); i += 4)
175 store_be(digest[i/4], output + i);
176 }
177
178/*
179* Clear memory of sensitive data
180*/
181void SHA_224::clear()
182 {
183 MDx_HashFunction::clear();
184 digest[0] = 0xC1059ED8;
185 digest[1] = 0x367CD507;
186 digest[2] = 0x3070DD17;
187 digest[3] = 0xF70E5939;
188 digest[4] = 0xFFC00B31;
189 digest[5] = 0x68581511;
190 digest[6] = 0x64F98FA7;
191 digest[7] = 0xBEFA4FA4;
192 }
193
194/*
195* SHA-256 compression function
196*/
197void SHA_256::compress_n(const byte input[], size_t blocks)
198 {
199 SHA2_32::compress(digest, input, blocks);
200 }
201
202/*
203* Copy out the digest
204*/
205void SHA_256::copy_out(byte output[])
206 {
207 for(size_t i = 0; i != output_length(); i += 4)
208 store_be(digest[i/4], output + i);
209 }
210
211/*
212* Clear memory of sensitive data
213*/
214void SHA_256::clear()
215 {
216 MDx_HashFunction::clear();
217 digest[0] = 0x6A09E667;
218 digest[1] = 0xBB67AE85;
219 digest[2] = 0x3C6EF372;
220 digest[3] = 0xA54FF53A;
221 digest[4] = 0x510E527F;
222 digest[5] = 0x9B05688C;
223 digest[6] = 0x1F83D9AB;
224 digest[7] = 0x5BE0CD19;
225 }
226
227}
Botan::MDx_HashFunction::clear
void clear()
Definition mdx_hash.cpp:32
Botan::SHA_224::clear
void clear()
Definition sha2_32.cpp:181
Botan::SHA_224::output_length
size_t output_length() const
Definition sha2_32.h:23
Botan::SHA_256::clear
void clear()
Definition sha2_32.cpp:214
Botan::SHA_256::output_length
size_t output_length() const
Definition sha2_32.h:44
Botan::SHA2_32
Definition sha2_32.cpp:17
Botan::rotate_right
T rotate_right(T input, size_t rot)
Definition rotate.h:34
Botan::u32bit
unsigned int u32bit
Definition types.h:32
Botan::load_be< u32bit >
u32bit load_be< u32bit >(const byte in[], size_t off)
Definition loadstor.h:166
Botan::store_be
void store_be(u16bit in, byte out[2])
Definition loadstor.h:412
SHA2_32_F
#define SHA2_32_F(A, B, C, D, E, F, G, H, M1, M2, M3, M4, magic)
Definition sha2_32.cpp:42
Generated by doxygen 1.18.0