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
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
|
/**********************************************************************
Copyright(c) 2011-2016 Intel Corporation All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
* Neither the name of Intel Corporation nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
**********************************************************************/
#include <string.h>
#include "sha1_mb.h"
#include "endian_helper.h"
////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////
// Reference SHA1 Functions
////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////
#if (__GNUC__ >= 11)
# define OPT_FIX __attribute__ ((noipa))
#else
# define OPT_FIX
#endif
#define H0 0x67452301
#define H1 0xefcdab89
#define H2 0x98badcfe
#define H3 0x10325476
#define H4 0xc3d2e1f0
#define F1(b,c,d) (d ^ (b & (c ^ d)))
#define F2(b,c,d) (b ^ c ^ d)
#define F3(b,c,d) ((b & c) | (d & (b | c)))
#define F4(b,c,d) (b ^ c ^ d)
#define rol32(x, r) (((x)<<(r)) ^ ((x)>>(32-(r))))
#define W(x) w[(x) & 15]
#define step00_19(i,a,b,c,d,e) \
if (i>15) W(i) = rol32(W(i-3)^W(i-8)^W(i-14)^W(i-16), 1); \
else W(i) = to_be32(ww[i]); \
e += rol32(a,5) + F1(b,c,d) + 0x5A827999 + W(i); \
b = rol32(b,30)
#define step20_39(i,a,b,c,d,e) \
W(i) = rol32(W(i-3)^W(i-8)^W(i-14)^W(i-16), 1); \
e += rol32(a,5) + F2(b,c,d) + 0x6ED9EBA1 + W(i); \
b = rol32(b,30)
#define step40_59(i,a,b,c,d,e) \
W(i) = rol32(W(i-3)^W(i-8)^W(i-14)^W(i-16), 1); \
e += rol32(a,5) + F3(b,c,d) + 0x8F1BBCDC + W(i); \
b = rol32(b,30)
#define step60_79(i,a,b,c,d,e) \
W(i) = rol32(W(i-3)^W(i-8)^W(i-14)^W(i-16), 1); \
e += rol32(a,5) + F4(b,c,d) + 0xCA62C1D6 + W(i); \
b = rol32(b,30)
static void OPT_FIX sha1_single(const uint8_t * data, uint32_t digest[]);
void sha1_ref(const uint8_t * input_data, uint32_t * digest, const uint32_t len)
{
uint32_t i, j;
uint8_t buf[2 * SHA1_BLOCK_SIZE];
digest[0] = H0;
digest[1] = H1;
digest[2] = H2;
digest[3] = H3;
digest[4] = H4;
i = len;
while (i >= SHA1_BLOCK_SIZE) {
sha1_single(input_data, digest);
input_data += SHA1_BLOCK_SIZE;
i -= SHA1_BLOCK_SIZE;
}
memcpy(buf, input_data, i);
buf[i++] = 0x80;
for (j = i; j < ((2 * SHA1_BLOCK_SIZE) - SHA1_PADLENGTHFIELD_SIZE); j++)
buf[j] = 0;
if (i > SHA1_BLOCK_SIZE - SHA1_PADLENGTHFIELD_SIZE)
i = 2 * SHA1_BLOCK_SIZE;
else
i = SHA1_BLOCK_SIZE;
*(uint64_t *) (buf + i - 8) = to_be64((uint64_t) len * 8);
sha1_single(buf, digest);
if (i == (2 * SHA1_BLOCK_SIZE))
sha1_single(buf + SHA1_BLOCK_SIZE, digest);
}
void sha1_single(const uint8_t * data, uint32_t digest[])
{
uint32_t a, b, c, d, e;
uint32_t w[16] = { 0 };
uint32_t *ww = (uint32_t *) data;
a = digest[0];
b = digest[1];
c = digest[2];
d = digest[3];
e = digest[4];
step00_19(0, a, b, c, d, e);
step00_19(1, e, a, b, c, d);
step00_19(2, d, e, a, b, c);
step00_19(3, c, d, e, a, b);
step00_19(4, b, c, d, e, a);
step00_19(5, a, b, c, d, e);
step00_19(6, e, a, b, c, d);
step00_19(7, d, e, a, b, c);
step00_19(8, c, d, e, a, b);
step00_19(9, b, c, d, e, a);
step00_19(10, a, b, c, d, e);
step00_19(11, e, a, b, c, d);
step00_19(12, d, e, a, b, c);
step00_19(13, c, d, e, a, b);
step00_19(14, b, c, d, e, a);
step00_19(15, a, b, c, d, e);
step00_19(16, e, a, b, c, d);
step00_19(17, d, e, a, b, c);
step00_19(18, c, d, e, a, b);
step00_19(19, b, c, d, e, a);
step20_39(20, a, b, c, d, e);
step20_39(21, e, a, b, c, d);
step20_39(22, d, e, a, b, c);
step20_39(23, c, d, e, a, b);
step20_39(24, b, c, d, e, a);
step20_39(25, a, b, c, d, e);
step20_39(26, e, a, b, c, d);
step20_39(27, d, e, a, b, c);
step20_39(28, c, d, e, a, b);
step20_39(29, b, c, d, e, a);
step20_39(30, a, b, c, d, e);
step20_39(31, e, a, b, c, d);
step20_39(32, d, e, a, b, c);
step20_39(33, c, d, e, a, b);
step20_39(34, b, c, d, e, a);
step20_39(35, a, b, c, d, e);
step20_39(36, e, a, b, c, d);
step20_39(37, d, e, a, b, c);
step20_39(38, c, d, e, a, b);
step20_39(39, b, c, d, e, a);
step40_59(40, a, b, c, d, e);
step40_59(41, e, a, b, c, d);
step40_59(42, d, e, a, b, c);
step40_59(43, c, d, e, a, b);
step40_59(44, b, c, d, e, a);
step40_59(45, a, b, c, d, e);
step40_59(46, e, a, b, c, d);
step40_59(47, d, e, a, b, c);
step40_59(48, c, d, e, a, b);
step40_59(49, b, c, d, e, a);
step40_59(50, a, b, c, d, e);
step40_59(51, e, a, b, c, d);
step40_59(52, d, e, a, b, c);
step40_59(53, c, d, e, a, b);
step40_59(54, b, c, d, e, a);
step40_59(55, a, b, c, d, e);
step40_59(56, e, a, b, c, d);
step40_59(57, d, e, a, b, c);
step40_59(58, c, d, e, a, b);
step40_59(59, b, c, d, e, a);
step60_79(60, a, b, c, d, e);
step60_79(61, e, a, b, c, d);
step60_79(62, d, e, a, b, c);
step60_79(63, c, d, e, a, b);
step60_79(64, b, c, d, e, a);
step60_79(65, a, b, c, d, e);
step60_79(66, e, a, b, c, d);
step60_79(67, d, e, a, b, c);
step60_79(68, c, d, e, a, b);
step60_79(69, b, c, d, e, a);
step60_79(70, a, b, c, d, e);
step60_79(71, e, a, b, c, d);
step60_79(72, d, e, a, b, c);
step60_79(73, c, d, e, a, b);
step60_79(74, b, c, d, e, a);
step60_79(75, a, b, c, d, e);
step60_79(76, e, a, b, c, d);
step60_79(77, d, e, a, b, c);
step60_79(78, c, d, e, a, b);
step60_79(79, b, c, d, e, a);
digest[0] += a;
digest[1] += b;
digest[2] += c;
digest[3] += d;
digest[4] += e;
}
|
