8#include <botan/sha160.h>
9#include <botan/loadstor.h>
10#include <botan/rotate.h>
11#include <botan/cpuid.h>
17 return std::unique_ptr<HashFunction>(
new SHA_160(*
this));
27inline void F1(uint32_t A, uint32_t& B, uint32_t C, uint32_t D, uint32_t& E, uint32_t msg)
29 E += (D ^ (B & (C ^ D))) + msg + 0x5A827999 + rotl<5>(A);
36inline void F2(uint32_t A, uint32_t& B, uint32_t C, uint32_t D, uint32_t& E, uint32_t msg)
38 E += (B ^ C ^ D) + msg + 0x6ED9EBA1 + rotl<5>(A);
45inline void F3(uint32_t A, uint32_t& B, uint32_t C, uint32_t D, uint32_t& E, uint32_t msg)
47 E += ((B & C) | ((B | C) & D)) + msg + 0x8F1BBCDC + rotl<5>(A);
54inline void F4(uint32_t A, uint32_t& B, uint32_t C, uint32_t D, uint32_t& E, uint32_t msg)
56 E += (B ^ C ^ D) + msg + 0xCA62C1D6 + rotl<5>(A);
67void SHA_160::compress_n(
const uint8_t input[],
size_t blocks)
69 using namespace SHA1_F;
71#if defined(BOTAN_HAS_SHA1_X86_SHA_NI)
72 if(CPUID::has_intel_sha())
74 return sha1_compress_x86(m_digest, input, blocks);
78#if defined(BOTAN_HAS_SHA1_ARMV8)
79 if(CPUID::has_arm_sha1())
81 return sha1_armv8_compress_n(m_digest, input, blocks);
85#if defined(BOTAN_HAS_SHA1_SSE2)
88 return sse2_compress_n(m_digest, input, blocks);
93 uint32_t A = m_digest[0], B = m_digest[1], C = m_digest[2],
94 D = m_digest[3], E = m_digest[4];
98 for(
size_t i = 0; i != blocks; ++i)
100 load_be(m_W.data(), input, 16);
102 for(
size_t j = 16; j != 80; j += 8)
104 m_W[j ] = rotl<1>(m_W[j-3] ^ m_W[j-8] ^ m_W[j-14] ^ m_W[j-16]);
105 m_W[j+1] = rotl<1>(m_W[j-2] ^ m_W[j-7] ^ m_W[j-13] ^ m_W[j-15]);
106 m_W[j+2] = rotl<1>(m_W[j-1] ^ m_W[j-6] ^ m_W[j-12] ^ m_W[j-14]);
107 m_W[j+3] = rotl<1>(m_W[j ] ^ m_W[j-5] ^ m_W[j-11] ^ m_W[j-13]);
108 m_W[j+4] = rotl<1>(m_W[j+1] ^ m_W[j-4] ^ m_W[j-10] ^ m_W[j-12]);
109 m_W[j+5] = rotl<1>(m_W[j+2] ^ m_W[j-3] ^ m_W[j- 9] ^ m_W[j-11]);
110 m_W[j+6] = rotl<1>(m_W[j+3] ^ m_W[j-2] ^ m_W[j- 8] ^ m_W[j-10]);
111 m_W[j+7] = rotl<1>(m_W[j+4] ^ m_W[j-1] ^ m_W[j- 7] ^ m_W[j- 9]);
114 F1(A, B, C, D, E, m_W[ 0]); F1(E, A, B, C, D, m_W[ 1]);
115 F1(D, E, A, B, C, m_W[ 2]); F1(C, D, E, A, B, m_W[ 3]);
116 F1(B, C, D, E, A, m_W[ 4]); F1(A, B, C, D, E, m_W[ 5]);
117 F1(E, A, B, C, D, m_W[ 6]); F1(D, E, A, B, C, m_W[ 7]);
118 F1(C, D, E, A, B, m_W[ 8]); F1(B, C, D, E, A, m_W[ 9]);
119 F1(A, B, C, D, E, m_W[10]); F1(E, A, B, C, D, m_W[11]);
120 F1(D, E, A, B, C, m_W[12]); F1(C, D, E, A, B, m_W[13]);
121 F1(B, C, D, E, A, m_W[14]); F1(A, B, C, D, E, m_W[15]);
122 F1(E, A, B, C, D, m_W[16]); F1(D, E, A, B, C, m_W[17]);
123 F1(C, D, E, A, B, m_W[18]); F1(B, C, D, E, A, m_W[19]);
125 F2(A, B, C, D, E, m_W[20]); F2(E, A, B, C, D, m_W[21]);
126 F2(D, E, A, B, C, m_W[22]); F2(C, D, E, A, B, m_W[23]);
127 F2(B, C, D, E, A, m_W[24]); F2(A, B, C, D, E, m_W[25]);
128 F2(E, A, B, C, D, m_W[26]); F2(D, E, A, B, C, m_W[27]);
129 F2(C, D, E, A, B, m_W[28]); F2(B, C, D, E, A, m_W[29]);
130 F2(A, B, C, D, E, m_W[30]); F2(E, A, B, C, D, m_W[31]);
131 F2(D, E, A, B, C, m_W[32]); F2(C, D, E, A, B, m_W[33]);
132 F2(B, C, D, E, A, m_W[34]); F2(A, B, C, D, E, m_W[35]);
133 F2(E, A, B, C, D, m_W[36]); F2(D, E, A, B, C, m_W[37]);
134 F2(C, D, E, A, B, m_W[38]); F2(B, C, D, E, A, m_W[39]);
136 F3(A, B, C, D, E, m_W[40]); F3(E, A, B, C, D, m_W[41]);
137 F3(D, E, A, B, C, m_W[42]); F3(C, D, E, A, B, m_W[43]);
138 F3(B, C, D, E, A, m_W[44]); F3(A, B, C, D, E, m_W[45]);
139 F3(E, A, B, C, D, m_W[46]); F3(D, E, A, B, C, m_W[47]);
140 F3(C, D, E, A, B, m_W[48]); F3(B, C, D, E, A, m_W[49]);
141 F3(A, B, C, D, E, m_W[50]); F3(E, A, B, C, D, m_W[51]);
142 F3(D, E, A, B, C, m_W[52]); F3(C, D, E, A, B, m_W[53]);
143 F3(B, C, D, E, A, m_W[54]); F3(A, B, C, D, E, m_W[55]);
144 F3(E, A, B, C, D, m_W[56]); F3(D, E, A, B, C, m_W[57]);
145 F3(C, D, E, A, B, m_W[58]); F3(B, C, D, E, A, m_W[59]);
147 F4(A, B, C, D, E, m_W[60]); F4(E, A, B, C, D, m_W[61]);
148 F4(D, E, A, B, C, m_W[62]); F4(C, D, E, A, B, m_W[63]);
149 F4(B, C, D, E, A, m_W[64]); F4(A, B, C, D, E, m_W[65]);
150 F4(E, A, B, C, D, m_W[66]); F4(D, E, A, B, C, m_W[67]);
151 F4(C, D, E, A, B, m_W[68]); F4(B, C, D, E, A, m_W[69]);
152 F4(A, B, C, D, E, m_W[70]); F4(E, A, B, C, D, m_W[71]);
153 F4(D, E, A, B, C, m_W[72]); F4(C, D, E, A, B, m_W[73]);
154 F4(B, C, D, E, A, m_W[74]); F4(A, B, C, D, E, m_W[75]);
155 F4(E, A, B, C, D, m_W[76]); F4(D, E, A, B, C, m_W[77]);
156 F4(C, D, E, A, B, m_W[78]); F4(B, C, D, E, A, m_W[79]);
158 A = (m_digest[0] += A);
159 B = (m_digest[1] += B);
160 C = (m_digest[2] += C);
161 D = (m_digest[3] += D);
162 E = (m_digest[4] += E);
171void SHA_160::copy_out(uint8_t output[])
183 m_digest[0] = 0x67452301;
184 m_digest[1] = 0xEFCDAB89;
185 m_digest[2] = 0x98BADCFE;
186 m_digest[3] = 0x10325476;
187 m_digest[4] = 0xC3D2E1F0;
size_t hash_block_size() const override final
size_t output_length() const override
std::unique_ptr< HashFunction > copy_state() const override
void zeroise(std::vector< T, Alloc > &vec)
T load_be(const uint8_t in[], size_t off)
void copy_out_vec_be(uint8_t out[], size_t out_bytes, const std::vector< T, Alloc > &in)