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
|
/*
* SHA-160
* (C) 1999-2008 Jack Lloyd
*
* Distributed under the terms of the Botan license
*/
#include <botan/sha160.h>
#include <botan/loadstor.h>
#include <botan/rotate.h>
namespace Botan {
namespace {
/*
* SHA-160 F1 Function
*/
inline void F1(u32bit A, u32bit& B, u32bit C, u32bit D, u32bit& E, u32bit msg)
{
E += (D ^ (B & (C ^ D))) + msg + 0x5A827999 + rotate_left(A, 5);
B = rotate_left(B, 30);
}
/*
* SHA-160 F2 Function
*/
inline void F2(u32bit A, u32bit& B, u32bit C, u32bit D, u32bit& E, u32bit msg)
{
E += (B ^ C ^ D) + msg + 0x6ED9EBA1 + rotate_left(A, 5);
B = rotate_left(B, 30);
}
/*
* SHA-160 F3 Function
*/
inline void F3(u32bit A, u32bit& B, u32bit C, u32bit D, u32bit& E, u32bit msg)
{
E += ((B & C) | ((B | C) & D)) + msg + 0x8F1BBCDC + rotate_left(A, 5);
B = rotate_left(B, 30);
}
/*
* SHA-160 F4 Function
*/
inline void F4(u32bit A, u32bit& B, u32bit C, u32bit D, u32bit& E, u32bit msg)
{
E += (B ^ C ^ D) + msg + 0xCA62C1D6 + rotate_left(A, 5);
B = rotate_left(B, 30);
}
}
/*
* SHA-160 Compression Function
*/
void SHA_160::compress_n(const byte input[], u32bit blocks)
{
u32bit A = digest[0], B = digest[1], C = digest[2],
D = digest[3], E = digest[4];
for(u32bit i = 0; i != blocks; ++i)
{
for(u32bit j = 0; j != 16; j += 4)
{
W[j ] = load_be<u32bit>(input, j);
W[j+1] = load_be<u32bit>(input, j+1);
W[j+2] = load_be<u32bit>(input, j+2);
W[j+3] = load_be<u32bit>(input, j+3);
}
input += HASH_BLOCK_SIZE;
for(u32bit j = 16; j != 80; j += 8)
{
W[j ] = rotate_left((W[j-3] ^ W[j-8] ^ W[j-14] ^ W[j-16]), 1);
W[j+1] = rotate_left((W[j-2] ^ W[j-7] ^ W[j-13] ^ W[j-15]), 1);
W[j+2] = rotate_left((W[j-1] ^ W[j-6] ^ W[j-12] ^ W[j-14]), 1);
W[j+3] = rotate_left((W[j ] ^ W[j-5] ^ W[j-11] ^ W[j-13]), 1);
W[j+4] = rotate_left((W[j+1] ^ W[j-4] ^ W[j-10] ^ W[j-12]), 1);
W[j+5] = rotate_left((W[j+2] ^ W[j-3] ^ W[j- 9] ^ W[j-11]), 1);
W[j+6] = rotate_left((W[j+3] ^ W[j-2] ^ W[j- 8] ^ W[j-10]), 1);
W[j+7] = rotate_left((W[j+4] ^ W[j-1] ^ W[j- 7] ^ W[j- 9]), 1);
}
F1(A, B, C, D, E, W[ 0]); F1(E, A, B, C, D, W[ 1]);
F1(D, E, A, B, C, W[ 2]); F1(C, D, E, A, B, W[ 3]);
F1(B, C, D, E, A, W[ 4]); F1(A, B, C, D, E, W[ 5]);
F1(E, A, B, C, D, W[ 6]); F1(D, E, A, B, C, W[ 7]);
F1(C, D, E, A, B, W[ 8]); F1(B, C, D, E, A, W[ 9]);
F1(A, B, C, D, E, W[10]); F1(E, A, B, C, D, W[11]);
F1(D, E, A, B, C, W[12]); F1(C, D, E, A, B, W[13]);
F1(B, C, D, E, A, W[14]); F1(A, B, C, D, E, W[15]);
F1(E, A, B, C, D, W[16]); F1(D, E, A, B, C, W[17]);
F1(C, D, E, A, B, W[18]); F1(B, C, D, E, A, W[19]);
F2(A, B, C, D, E, W[20]); F2(E, A, B, C, D, W[21]);
F2(D, E, A, B, C, W[22]); F2(C, D, E, A, B, W[23]);
F2(B, C, D, E, A, W[24]); F2(A, B, C, D, E, W[25]);
F2(E, A, B, C, D, W[26]); F2(D, E, A, B, C, W[27]);
F2(C, D, E, A, B, W[28]); F2(B, C, D, E, A, W[29]);
F2(A, B, C, D, E, W[30]); F2(E, A, B, C, D, W[31]);
F2(D, E, A, B, C, W[32]); F2(C, D, E, A, B, W[33]);
F2(B, C, D, E, A, W[34]); F2(A, B, C, D, E, W[35]);
F2(E, A, B, C, D, W[36]); F2(D, E, A, B, C, W[37]);
F2(C, D, E, A, B, W[38]); F2(B, C, D, E, A, W[39]);
F3(A, B, C, D, E, W[40]); F3(E, A, B, C, D, W[41]);
F3(D, E, A, B, C, W[42]); F3(C, D, E, A, B, W[43]);
F3(B, C, D, E, A, W[44]); F3(A, B, C, D, E, W[45]);
F3(E, A, B, C, D, W[46]); F3(D, E, A, B, C, W[47]);
F3(C, D, E, A, B, W[48]); F3(B, C, D, E, A, W[49]);
F3(A, B, C, D, E, W[50]); F3(E, A, B, C, D, W[51]);
F3(D, E, A, B, C, W[52]); F3(C, D, E, A, B, W[53]);
F3(B, C, D, E, A, W[54]); F3(A, B, C, D, E, W[55]);
F3(E, A, B, C, D, W[56]); F3(D, E, A, B, C, W[57]);
F3(C, D, E, A, B, W[58]); F3(B, C, D, E, A, W[59]);
F4(A, B, C, D, E, W[60]); F4(E, A, B, C, D, W[61]);
F4(D, E, A, B, C, W[62]); F4(C, D, E, A, B, W[63]);
F4(B, C, D, E, A, W[64]); F4(A, B, C, D, E, W[65]);
F4(E, A, B, C, D, W[66]); F4(D, E, A, B, C, W[67]);
F4(C, D, E, A, B, W[68]); F4(B, C, D, E, A, W[69]);
F4(A, B, C, D, E, W[70]); F4(E, A, B, C, D, W[71]);
F4(D, E, A, B, C, W[72]); F4(C, D, E, A, B, W[73]);
F4(B, C, D, E, A, W[74]); F4(A, B, C, D, E, W[75]);
F4(E, A, B, C, D, W[76]); F4(D, E, A, B, C, W[77]);
F4(C, D, E, A, B, W[78]); F4(B, C, D, E, A, W[79]);
A = (digest[0] += A);
B = (digest[1] += B);
C = (digest[2] += C);
D = (digest[3] += D);
E = (digest[4] += E);
}
}
/*
* Copy out the digest
*/
void SHA_160::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_160::clear()
{
MDx_HashFunction::clear();
W.clear();
digest[0] = 0x67452301;
digest[1] = 0xEFCDAB89;
digest[2] = 0x98BADCFE;
digest[3] = 0x10325476;
digest[4] = 0xC3D2E1F0;
}
/*
* SHA_160 Constructor
*/
SHA_160::SHA_160() :
MDx_HashFunction(20, 64, true, true), W(80)
{
clear();
}
/*
* SHA_160 Constructor
*/
SHA_160::SHA_160(u32bit W_size) :
MDx_HashFunction(20, 64, true, true), W(W_size)
{
clear();
}
}
|
