Coverage Report

Created: 2023-06-07 07:00

/src/botan/src/lib/hash/sha2_32/sha2_32.cpp
Line
Count
Source (jump to first uncovered line)
1
/*
2
* SHA-{224,256}
3
* (C) 1999-2010,2017 Jack Lloyd
4
*     2007 FlexSecure GmbH
5
*
6
* Botan is released under the Simplified BSD License (see license.txt)
7
*/
8
9
#include <botan/internal/sha2_32.h>
10
11
#include <botan/internal/bit_ops.h>
12
#include <botan/internal/cpuid.h>
13
#include <botan/internal/loadstor.h>
14
#include <botan/internal/rotate.h>
15
#include <botan/internal/sha2_32_f.h>
16
17
namespace Botan {
18
19
namespace {
20
21
0
std::string sha256_provider() {
22
0
#if defined(BOTAN_HAS_SHA2_32_X86)
23
0
   if(CPUID::has_intel_sha()) {
24
0
      return "shani";
25
0
   }
26
0
#endif
27
28
0
#if defined(BOTAN_HAS_SHA2_32_X86_BMI2)
29
0
   if(CPUID::has_bmi2()) {
30
0
      return "bmi2";
31
0
   }
32
0
#endif
33
34
#if defined(BOTAN_HAS_SHA2_32_ARMV8)
35
   if(CPUID::has_arm_sha2()) {
36
      return "armv8";
37
   }
38
#endif
39
40
0
   return "base";
41
0
}
42
43
}  // namespace
44
45
0
std::unique_ptr<HashFunction> SHA_224::copy_state() const { return std::make_unique<SHA_224>(*this); }
46
47
0
std::unique_ptr<HashFunction> SHA_256::copy_state() const { return std::make_unique<SHA_256>(*this); }
48
49
/*
50
* SHA-224 / SHA-256 compression function
51
*/
52
10
void SHA_256::compress_digest(secure_vector<uint32_t>& digest, const uint8_t input[], size_t blocks) {
53
10
#if defined(BOTAN_HAS_SHA2_32_X86)
54
10
   if(CPUID::has_intel_sha()) {
55
0
      return SHA_256::compress_digest_x86(digest, input, blocks);
56
0
   }
57
10
#endif
58
59
10
#if defined(BOTAN_HAS_SHA2_32_X86_BMI2)
60
10
   if(CPUID::has_bmi2()) {
61
10
      return SHA_256::compress_digest_x86_bmi2(digest, input, blocks);
62
10
   }
63
0
#endif
64
65
#if defined(BOTAN_HAS_SHA2_32_ARMV8)
66
   if(CPUID::has_arm_sha2()) {
67
      return SHA_256::compress_digest_armv8(digest, input, blocks);
68
   }
69
#endif
70
71
0
   uint32_t A = digest[0], B = digest[1], C = digest[2], D = digest[3], E = digest[4], F = digest[5], G = digest[6],
72
0
            H = digest[7];
73
74
0
   for(size_t i = 0; i != blocks; ++i) {
75
0
      uint32_t W00 = load_be<uint32_t>(input, 0);
76
0
      uint32_t W01 = load_be<uint32_t>(input, 1);
77
0
      uint32_t W02 = load_be<uint32_t>(input, 2);
78
0
      uint32_t W03 = load_be<uint32_t>(input, 3);
79
0
      uint32_t W04 = load_be<uint32_t>(input, 4);
80
0
      uint32_t W05 = load_be<uint32_t>(input, 5);
81
0
      uint32_t W06 = load_be<uint32_t>(input, 6);
82
0
      uint32_t W07 = load_be<uint32_t>(input, 7);
83
0
      uint32_t W08 = load_be<uint32_t>(input, 8);
84
0
      uint32_t W09 = load_be<uint32_t>(input, 9);
85
0
      uint32_t W10 = load_be<uint32_t>(input, 10);
86
0
      uint32_t W11 = load_be<uint32_t>(input, 11);
87
0
      uint32_t W12 = load_be<uint32_t>(input, 12);
88
0
      uint32_t W13 = load_be<uint32_t>(input, 13);
89
0
      uint32_t W14 = load_be<uint32_t>(input, 14);
90
0
      uint32_t W15 = load_be<uint32_t>(input, 15);
91
92
0
      SHA2_32_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x428A2F98);
93
0
      SHA2_32_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x71374491);
94
0
      SHA2_32_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0xB5C0FBCF);
95
0
      SHA2_32_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0xE9B5DBA5);
96
0
      SHA2_32_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x3956C25B);
97
0
      SHA2_32_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x59F111F1);
98
0
      SHA2_32_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x923F82A4);
99
0
      SHA2_32_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0xAB1C5ED5);
100
0
      SHA2_32_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0xD807AA98);
101
0
      SHA2_32_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0x12835B01);
102
0
      SHA2_32_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0x243185BE);
103
0
      SHA2_32_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0x550C7DC3);
104
0
      SHA2_32_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0x72BE5D74);
105
0
      SHA2_32_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0x80DEB1FE);
106
0
      SHA2_32_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0x9BDC06A7);
107
0
      SHA2_32_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0xC19BF174);
108
109
0
      SHA2_32_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0xE49B69C1);
110
0
      SHA2_32_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0xEFBE4786);
111
0
      SHA2_32_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x0FC19DC6);
112
0
      SHA2_32_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x240CA1CC);
113
0
      SHA2_32_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x2DE92C6F);
114
0
      SHA2_32_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x4A7484AA);
115
0
      SHA2_32_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x5CB0A9DC);
116
0
      SHA2_32_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x76F988DA);
117
0
      SHA2_32_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0x983E5152);
118
0
      SHA2_32_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0xA831C66D);
119
0
      SHA2_32_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0xB00327C8);
120
0
      SHA2_32_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0xBF597FC7);
121
0
      SHA2_32_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0xC6E00BF3);
122
0
      SHA2_32_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xD5A79147);
123
0
      SHA2_32_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0x06CA6351);
124
0
      SHA2_32_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0x14292967);
125
126
0
      SHA2_32_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x27B70A85);
127
0
      SHA2_32_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x2E1B2138);
128
0
      SHA2_32_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x4D2C6DFC);
129
0
      SHA2_32_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x53380D13);
130
0
      SHA2_32_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x650A7354);
131
0
      SHA2_32_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x766A0ABB);
132
0
      SHA2_32_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x81C2C92E);
133
0
      SHA2_32_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x92722C85);
134
0
      SHA2_32_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0xA2BFE8A1);
135
0
      SHA2_32_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0xA81A664B);
136
0
      SHA2_32_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0xC24B8B70);
137
0
      SHA2_32_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0xC76C51A3);
138
0
      SHA2_32_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0xD192E819);
139
0
      SHA2_32_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xD6990624);
140
0
      SHA2_32_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0xF40E3585);
141
0
      SHA2_32_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0x106AA070);
142
143
0
      SHA2_32_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x19A4C116);
144
0
      SHA2_32_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x1E376C08);
145
0
      SHA2_32_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x2748774C);
146
0
      SHA2_32_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x34B0BCB5);
147
0
      SHA2_32_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x391C0CB3);
148
0
      SHA2_32_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x4ED8AA4A);
149
0
      SHA2_32_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x5B9CCA4F);
150
0
      SHA2_32_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x682E6FF3);
151
0
      SHA2_32_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0x748F82EE);
152
0
      SHA2_32_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0x78A5636F);
153
0
      SHA2_32_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0x84C87814);
154
0
      SHA2_32_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0x8CC70208);
155
0
      SHA2_32_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0x90BEFFFA);
156
0
      SHA2_32_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xA4506CEB);
157
0
      SHA2_32_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0xBEF9A3F7);
158
0
      SHA2_32_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0xC67178F2);
159
160
0
      A = (digest[0] += A);
161
0
      B = (digest[1] += B);
162
0
      C = (digest[2] += C);
163
0
      D = (digest[3] += D);
164
0
      E = (digest[4] += E);
165
0
      F = (digest[5] += F);
166
0
      G = (digest[6] += G);
167
0
      H = (digest[7] += H);
168
169
0
      input += 64;
170
0
   }
171
0
}
172
173
0
std::string SHA_224::provider() const { return sha256_provider(); }
174
175
0
std::string SHA_256::provider() const { return sha256_provider(); }
176
177
/*
178
* SHA-224 compression function
179
*/
180
0
void SHA_224::compress_n(const uint8_t input[], size_t blocks) { SHA_256::compress_digest(m_digest, input, blocks); }
181
182
/*
183
* Copy out the digest
184
*/
185
0
void SHA_224::copy_out(uint8_t output[]) { copy_out_vec_be(output, output_length(), m_digest); }
186
187
/*
188
* Clear memory of sensitive data
189
*/
190
0
void SHA_224::clear() {
191
0
   MDx_HashFunction::clear();
192
0
   m_digest[0] = 0xC1059ED8;
193
0
   m_digest[1] = 0x367CD507;
194
0
   m_digest[2] = 0x3070DD17;
195
0
   m_digest[3] = 0xF70E5939;
196
0
   m_digest[4] = 0xFFC00B31;
197
0
   m_digest[5] = 0x68581511;
198
0
   m_digest[6] = 0x64F98FA7;
199
0
   m_digest[7] = 0xBEFA4FA4;
200
0
}
201
202
/*
203
* SHA-256 compression function
204
*/
205
10
void SHA_256::compress_n(const uint8_t input[], size_t blocks) { SHA_256::compress_digest(m_digest, input, blocks); }
206
207
/*
208
* Copy out the digest
209
*/
210
4
void SHA_256::copy_out(uint8_t output[]) { copy_out_vec_be(output, output_length(), m_digest); }
211
212
/*
213
* Clear memory of sensitive data
214
*/
215
7
void SHA_256::clear() {
216
7
   MDx_HashFunction::clear();
217
7
   m_digest[0] = 0x6A09E667;
218
7
   m_digest[1] = 0xBB67AE85;
219
7
   m_digest[2] = 0x3C6EF372;
220
7
   m_digest[3] = 0xA54FF53A;
221
7
   m_digest[4] = 0x510E527F;
222
7
   m_digest[5] = 0x9B05688C;
223
7
   m_digest[6] = 0x1F83D9AB;
224
7
   m_digest[7] = 0x5BE0CD19;
225
7
}
226
227
}  // namespace Botan